Laskettelukeskus

#include <bits/stdc++.h>
#define ll long long
#define FOR(m) for (long i = 0; i<m; i++)
using namespace std;

vector<vector<ll>> adj(int(1e5+1), vector<ll>()); // left, right
vector <ll> wt(int(1e5+1), 0);

ll dfs(int a, int b) {
    ll ans = 0ll;
    for (int v : adj[a]) {
        if (v == b)
            continue;
        ans += dfs(v, a);
    }
    return max(ans, wt[a]);
}

int main() {
    ll n, a, b;
    cin >> n;

    FOR (n-1) {
        cin >> a >> b;
        adj[a-1].push_back(b-1);
        adj[b-1].push_back(a-1);
    }
    FOR (n) {
        cin >> a;
        wt[i] = a;
    }

    cout << dfs(0, 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