#include<iostream>
#include<cmath>
#include<cstdlib>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<vector>
#define maxn 6010
using namespace std;
vector<int>b[maxn];
int n,a1,a2,val[maxn],f[maxn][2];
void dfs(int p,int fa){
	f[p][1]=val[p];
	for(int i=0;i<b[p].size();i++){
		int x=b[p][i];if(x==fa)continue;
		dfs(x,p);
		f[p][0]+=max(f[x][0],f[x][1]);
		f[p][1]+=f[x][0];
	}
	return;
}
int main(){
	freopen("partyy.in","r",stdin);
	freopen("partyy.out","w",stdout);
	scanf("%d",&n);
	for(int i=1;i<=n;i++)scanf("%d",&val[i]);
	for(int i=1;i<=n;i++){
		scanf("%d%d",&a1,&a2);
		b[a1].push_back(a2);
		b[a2].push_back(a1);
	}
	dfs(1,0);
	printf("%d\n",max(f[1][0],f[1][1]));
	return 0;
}