#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream f("asmax.in");
ofstream g("asmax.out");
vector <int> a[16001];
int n,b[16001],viz[16001],c[16001],i,j,summax=-1001;
int dfs(int x)
{int y;
viz[x]=1;
for(int k=0;k<a[x].size();k++)
    if(!viz[a[x][k]]) {y=dfs(a[x][k]);
     if(y>0) c[x]+=y;
    }
return c[x];
}
int main()
{f>>n;
for(int k=1;k<=n;k++) f>>c[k];
for(int k=1;k<n;k++)
{f>>i>>j;a[i].push_back(j);a[j].push_back(i);}
dfs(1);
for(int i=1;i<=n;i++)
    summax=max(summax,c[i]);//cout<<c[i]<<' ';
g<<summax;
    return 0;
}