Laskettelukeskus

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

const int N=100009;

int n,nE,hd[N];
struct Edge{
	int to,nxt;
};
Edge e[N*2];
void add(int u,int 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;
}

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

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