Laskettelukeskus

#include <bits/stdc++.h>

#define debug(x) cout << #x << ": " << x << "\n"
#define all(x) x.begin(), x.end()

using namespace std;
using ll = long long;

const int N = 1e5 + 10;
const int inf = 1e9;
const ll LLinf = 5e18;

vector<int> g[N];
ll v[N];

void dfs(int cur) {

    ll s = 0;
    for(int nex : g[cur]) {
        dfs(nex);
        s += v[nex];
    }
    v[cur] = max(v[cur], s);
}

int main() {

    int n;
    cin >> n;
    for(int _ = 0; _ < n - 1; ++_) {
        int a, b;
        cin >> a >> b;
        g[a].push_back(b);
    }
    for(int i = 1; i <= n; ++i) {
        cin >> v[i];
    }
    dfs(1);
    cout << v[1] << "\n";

}

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