#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<algorithm>
#define ll long long
using namespace std;
const int maxn=200000;
struct my
{
	int y,next;
}e[maxn];
int len=0,linkk[maxn];
ll v[maxn];
void insert(int xx,int yy)
{
	e[++len].y=yy;
	e[len].next=linkk[xx],linkk[xx]=len;
}
int n;
ll ans,c=0;
bool vis[maxn];
ll dfs(int x)
{
	vis[x]=1;
	for(int i=linkk[x];i;i=e[i].next)
	{
		int to=e[i].y;
		if(vis[to])	continue;
		v[x]+=dfs(to);
	}
	ans=max(ans,v[x]);
	return max(v[x],c);
}
int main()
{
	freopen("makeup.in","r",stdin);
	freopen("makeup.out","w",stdout);
	cin>>n;
	for(int i=1;i<=n;i++)
		scanf("%lld",&v[i]);
	for(int i=1;i<n;i++)
	{
		int a,b;
		scanf("%d%d",&a,&b);
		insert(a,b);
		insert(b,a);
	}
	dfs(1);
	cout<<ans<<endl;
	return 0;
}