Laskettelukeskus

#include <iostream>
#include <vector>
#include <climits>
using namespace std;

using ll = long long;

ll solve(const vector<vector<ll>>& v, const vector<ll>& min_req, ll node) {
    ll min = 0;
    for (auto i : v[node]) {
        min += solve(v, min_req, i);
    }
    return max(min, min_req[node]);
}

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

    ll min = solve(v, min_req, 0);
    cout << min << 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