Laskettelukeskus

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

typedef long long ll;
const ll N=100009;

ll n,nE,hd[N];
struct Edge{
	ll to,nxt;
};
Edge e[N*2];
void add(ll u,ll v){
	e[++nE].to=v;
	e[nE].nxt=hd[u];
	hd[u]=nE;
	e[++nE].to=u;
	e[nE].nxt=hd[v];
	hd[v]=nE;
}

ll x[N];
ll solve(ll u,ll fa){
	ll cmp=0;
	for(ll i=hd[u];i;i=e[i].nxt){
		ll v=e[i].to;
		if(v==fa)continue;
		
		cmp+=solve(v,u);
	}
	return max(x[u],cmp);
}

int main(){
	cin>>n;
	for(ll i=1;i<n;i++){
		ll a,b;
		cin>>a>>b;
		add(a,b);
	}
	
	for(ll i=1;i<=n;i++){
		cin>>x[i];
	}
	
	cout<<solve(1,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