Laskettelukeskus

#include <iostream>
#include <vector>

using namespace std;

vector<vector<int>> tree;
vector<int> c;
vector<int> needed;

int total_plows = 0;

void dfs(int v) {
    //cout << c[v] << "cV\n";
    int sum = 0;
    for (int u : tree[v]) {
        if (u == v) continue;
        dfs(u);
        sum += needed[u];
    }
    needed[v] = max(c[v], sum);
    //cout << needed[v] << " " << v << "needed V\n";
}

int main() {
    int n;
    cin >> n;

    tree.resize(n + 1);
    c.resize(n + 1);
    needed.resize(n + 1);

    for (int i = 1; i < n; i++) {
        int a, b;
        cin >> a >> b;
        tree[a].push_back(b);
    }

    for (int i = 1; i <= n; i++) {
        cin >> c[i];
    }

    dfs(1);

    cout << needed[1] << endl;

    return 0;
}

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 1, 2

Verdict: ACCEPTED

Test 3

Group: 1, 2

Verdict: ACCEPTED

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: ACCEPTED

Test 11

Group: 2

Verdict: WRONG ANSWER

Test 12

Group: 1, 2

Verdict: ACCEPTED

Test 13

Group: 2

Verdict: WRONG ANSWER