Laskettelukeskus

#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;



vector<int> T[101010];
int W[101010];

int dfs(int cur, int from) {
    int s = 0; 
    for (auto u: T[cur]) {
        if (u != from) s+= dfs(u, cur);
    }
    return max(W[cur], s);
}

int main() { 
    int n;
    cin >> n;
    for (int i=0; i<n-1; i++) {
        int a, b;
        cin >> a >> b;
        T[a].push_back(b);
        T[b].push_back(a);
    }
    for (int i=1; i<=n; i++) {
        int w;
        cin >> w;
        W[i] = w;
    }
    cout << dfs(1, 1);
}
 

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