Laskettelukeskus

#include <bits/stdc++.h>
std::vector<int> adj[100100];
long long c[100100];
long long dp[100100];
void dfs(int u, int p) {
    for (int v : adj[u]) if (v != p) {
        dfs(v, u);
        dp[u] += dp[v];
    }
    dp[u] = std::max(dp[u], c[u]);
}
int main() {
    int n;
    std::cin >> n;
    for (int i = 1; i < n; ++i) {
        int u, v;
        std::cin >> u >> v;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }
    for (int i = 1; i <= n; ++i) std::cin >> c[i];
    dfs(1, -1);
    std::cout << dp[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