Laskettelukeskus

#include <iostream>
#include <vector>

using namespace std;

int n;
vector<vector<int>> g;

vector<int> a;

int c;

void dfs(int v) {
    if (a[v] > c) {
        c = a[v];
    }
    for (int u : g[v]) {
        dfs(u);
    }
}

int main() {
    cin >> n;
    g.resize(n);
    for (int i = 0; i < n - 1; i++) {
        int u, v; cin >> u >> v;
        g[u - 1].push_back(v - 1);
    }
    a.resize(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    int ANS = 0;
    for (int v : g[0]) {
        c = -1e9;
        dfs(v);
        ANS += c;
    }
    cout << ANS;
}

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 1, 2

Verdict: WRONG ANSWER

Test 3

Group: 1, 2

Verdict: WRONG ANSWER

Test 4

Group: 2

Verdict: WRONG ANSWER

Test 5

Group: 2

Verdict: WRONG ANSWER

Test 6

Group: 1, 2

Verdict: ACCEPTED

Test 7

Group: 2

Verdict: ACCEPTED

Test 8

Group: 1, 2

Verdict: ACCEPTED

Test 9

Group: 2

Verdict: ACCEPTED

Test 10

Group: 1, 2

Verdict: WRONG ANSWER

Test 11

Group: 2

Verdict: WRONG ANSWER

Test 12

Group: 1, 2

Verdict: WRONG ANSWER

Test 13

Group: 2

Verdict: WRONG ANSWER