Laskettelukeskus

#include <iostream>
#include <vector>

using namespace std;

typedef unsigned long long int u8;

u8 n;
vector<vector<u8>> t;
vector<u8> c;

u8 bfs(u8 v) {
  u8 cs = 0;
  for (auto u : t[v]) {
    cs += bfs(u);
  }
  return max(cs, c[v]);
}

int main() {
  
  cin >> n;
  t.resize(n);

  for (u8 i = 1; i < n; i++) {
    u8 a, b;
    cin >> a >> b;
    t[a - 1].push_back(b - 1);
    //t[b - 1].push_back(a - 1);
  }

  for (u8 i = 0; i < n; i++) {
    u8 a;
    cin >> a;
    c.push_back(a);
  }

  cout << bfs(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