#include<fstream>
#include<list>
#include<algorithm>
using namespace std;
struct nod{int info,c;nod*adr;}*v[16003],*p;
int n,i,x,y,val[16003];
short viz[16003];
int smax[16003];
list<int>nr[16003];
void dfs(int nd)
{
	viz[nd]=1;
	nod*p=v[nd];
	smax[nd]=val[nd];
	while(p)
	{
		if(!viz[p->info])
		{
		 dfs(p->info);
		 if(smax[nd]+smax[p->info]>smax[nd])
		 {
		  smax[nd]+=smax[p->info];
		  nr[nd].push_back(smax[p->info]);
		 }
		}
		p=p->adr;
	}
}
void dfs_dinamica(int nd)
{
	viz[nd]=0;
	nod*p=v[nd];
	while(p)
	{
		if(viz[p->info])
		{
		  smax[p->info]=max(smax[p->info],smax[nd]-nr[nd].front()+smax[p->info]);
		  nr[nd].pop_front();
		  dfs_dinamica(p->info);
		}
		p=p->adr;
	}
}
int main()
{
	ifstream f("asmax.in");ofstream g("asmax.out");
	f>>n;
	for(i=1;i<=n;i++)f>>val[i];
	for(i=1;i<n;i++)
	{
		f>>x>>y;
		p=new nod;
		p->info=y; p->adr=v[x]; v[x]=p;
		p=new nod;
		p->info=x; p->adr=v[y]; v[y]=p;
	}
	dfs(1);
	dfs_dinamica(1);
	g<<*max_element(smax+1,smax+n+1)<<'\n';
	f.close();g.close();
return 0;}