#include<cstdio>
#include<vector>
using namespace std;
vector <int> l[16001];
int viz[16001],f[16001],p[16001];



void dfs(int u)
{
    int s=0;
    vector<int>::iterator it;
    viz[u]=1;
    s+=f[u];
    for(it=l[u].begin();it!=l[u].end();++it)
        if(!viz[*it])
        {
            dfs(*it);
            if(p[*it]>0)
                s+=p[*it];
        }
    p[u]=s;
    //return s;
}





int main()
{
    freopen("asmax.in","r",stdin);
    freopen("asmax.out","w",stdout);
    int n,i,max=0;
    scanf("%d",&n);
    for(i=1;i<=n;++i)
        scanf("%d",&f[i]);
    int u,v;
    for(i=1;i<n;++i)
    {
        scanf("%d%d",&u,&v);
        l[u].push_back(v);
        l[v].push_back(u);
    }
    dfs(1);
    for(i=1;i<=n;++i)
        if(p[i]>max)
            max=p[i];
    printf("%d\n",max);
    return 0;
}