Laskettelukeskus

#include <iostream>
#include <vector>

using namespace std;

typedef long long ll;

vector<ll> adj[100005];
ll nodeSnow[100005] = {};

ll dfs(ll s) {
    ll parentSnow = nodeSnow[s];
    ll childSnow = 0;
    for (auto u : adj[s]) {
        childSnow += dfs(u);
    }
    return max(childSnow, parentSnow);
}

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

    for (ll i = 0; i < n - 1; i++) {
        ll a, b;
        cin >> a >> b;
        a--;
        b--;
        adj[a].push_back(b);
    }

    for (ll i = 0; i < n; i++) {
        ll a;
        cin >> a;
        nodeSnow[i] = a;
    }

    cout << dfs(0) << 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: ACCEPTED

Test 5

Group: 2

Verdict: ACCEPTED

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

Test 12

Group: 1, 2

Verdict: ACCEPTED

Test 13

Group: 2

Verdict: ACCEPTED