Laskettelukeskus

#include <bits/stdc++.h>

using namespace std;

int check(int curr, vector<vector<int>> &adj, vector<int> &plows) {
  int sum = 0;
  for (int lower : adj[curr]) {
    sum += check(lower, adj, plows);
  }
  return max(sum, plows[curr]);
}

int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int n;
  cin >> n;
  vector<vector<int>> adj(n+1);
  vector<int> plows(n+1);
  for (int i = 1; i < n; ++i) {
    int a, b;
    cin >> a >> b;
    adj[a].push_back(b); // there is a path from a to b
  }
  for (int i = 1; i <= n; ++i) {
    cin >> plows[i];
  }
  cout << check(1, adj, plows);
}

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