#include <bits/stdc++.h>

using namespace std;

ifstream fin("asmax.in");
ofstream fout("asmax.out");

int n;
int dp[16005];
bitset<16005>viz;
vector<int>L[16005];

void Citire()
{
    fin>>n;
    for(int i=1;i<=n;i++)
        fin>>dp[i];

    for(int i=1;i<=n;i++)
    {
        int x,y;
        fin>>x>>y;
        L[x].push_back(y);
        L[y].push_back(x);
    }

}

void DFS(int nod,int tata)
{
    viz[nod]=1;
    for(auto i:L[nod])
        if(i!=tata)
        {
            if(!viz[i])DFS(i,nod);
            if(dp[i]>=0)dp[nod]+=dp[i];
        }
}

void Rezolva()
{
    DFS(1,0);
    int sol=-1001;
    for(int i=1;i<=n;i++)
        sol=max(sol,dp[i]);

    fout<<sol<<"\n";
}



int main()
{
    Citire();
    Rezolva();
    return 0;
}