Laskettelukeskus

#include<iostream>
#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
 
constexpr ll M = 1000000007;
constexpr ll P = (1 << 18);
constexpr int INF = 1e9;

vector<int> adj[101010];
long long int times[101010]; 

long long int dfs(int s, int e) {
	if (adj[s].size() == 0) {
		return times[s];
	}

	long long int sum = 0;
	for (auto u : adj[s]) { 
		if (u == e) continue;
		sum += dfs(u, s); 
	}

	long long int ans = max(sum, times[s]);
	//cout << s << " " << ans << endl;
	return ans;
}

int main() {
        int n;
	cin >> n;

	for (int i=0; i<n-1; i++) {
		int a, b;
		cin >> a >> b;

		adj[a].push_back(b);
	}

	for (int i=1; i<=n; i++) {
		cin >> times[i];
	}

	long long int ans = dfs(1, 0); 
	cout << ans << 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