Laskettelukeskus

#include <bits/stdc++.h>

using namespace std;

int n;
vector<int> polut[100000];
uint64_t kerrat[100000];

uint64_t min_needed(int node)
{
    uint64_t res = 0;

    for (auto neighbor : polut[node]) {
        res += min_needed(neighbor);
        // cout << node << " " << neighbor << endl;
    }

    return max(res, kerrat[node]);
}

int main()
{
    cin >> n;

    for (int i = 0; i < n - 1; i++) {
        int a, b;
        cin >> a >> b;
        a--;
        b--;
        polut[a].push_back(b);
    }

    for (int i = 0; i < n; i++) {
        uint64_t a;
        cin >> a;
        kerrat[i] = a;
    }

    // cout << "DEBUG" << endl;
    cout << min_needed(0) << endl;
}

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