Laskettelukeskus

#include <vector>
#include <algorithm>
#include <iostream>

using namespace std;

const int MAX_N = 100000;

int n;
vector<int> c(MAX_N);
vector<vector<int>> adj(MAX_N);
vector<long long> dp(MAX_N, 0);

void dfs(int v, int p = -1)
{
    dp[v] = c[v];
    long long sum = 0;
    for (int u : adj[v])
    {
        if (u == p)
            continue;
        dfs(u, v);
        sum += dp[u];
    }
    dp[v] = max(dp[v], sum);
}

int main()
{
    cin >> n;
    for (int i = 0; i < n - 1; ++i)
    {
        int a, b;
        cin >> a >> b;
        --a;
        --b;
        adj[a].push_back(b);
        adj[b].push_back(a);
    }
    for (int i = 0; i < n; ++i)
    {
        cin >> c[i];
    }
    dfs(0);
    cout << dp[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