P1122 最大子树和

//#define local
#include<cstdio>
#include<iostream>
#include<vector>
#include<cmath>
#define MAXN 16005
#define INF 0x7fffffff 
using namespace std;
typedef long long ll; 
int dp[MAXN];//dp[i]表示当前结点可得到的最大值 
vector<int>e[MAXN];
int n; 
void dfs(int cur,int fa){
  	for(int i=0;i<e[cur].size();++i){
		int next=e[cur][i];
		if(next!=fa){
		dfs(next,cur);
		dp[cur]=max(dp[cur],dp[cur]+dp[next]);
		}
	}
}
int main(){
#ifdef local
freopen("data.in","rb",stdin);
//freopen("data.out","wb",stdout);
#endif
scanf("%d",&n);
for(int i=1;i<=n;++i)
	scanf("%d",&dp[i]);
for(int i=1;i<=n-1;++i){
	int a,b;
	scanf("%d%d",&a,&b);
	e[a].push_back(b);
	e[b].push_back(a);
}
dfs(2,0);
int ans=-INF;
for(int i=1;i<=n;++i){
	if(ans<dp[i])
	ans=dp[i];
}
printf("%d",ans);
return 0;
}