#include <bits/stdc++.h>
#define M 16005
using namespace std;
ifstream in("asmax.in");
ofstream out("asmax.out");
int n,maxim=INT_MIN,maxx=INT_MIN;
vector<int> lista[M];
int v[M],dp[M];
void citire()
{
    in>>n;
    for(int i=1;i<=n;i++)
    {
        in>>v[i];
        maxx=max(maxx,v[i]);
    }
    int x,y;
    for(int i=1;i<=n;i++)
    {
        in>>x>>y;
        lista[x].push_back(y);
        lista[y].push_back(x);
    }
}
void dfs(int node,int tata)
{
    for(auto x:lista[node])
        if(x!=tata)
            dfs(x,node);
    dp[node]=v[node];
    for(auto x:lista[node])
    {
        if(x==tata)
            continue;
        dp[node]+=dp[x];
    }
    dp[node]=max(dp[node],0);
}
int main()
{
    citire();
    dfs(1,1);
    for(int i=1;i<=n;i++)
        maxim=max(maxim,dp[i]);
    if(maxim==0)
        out<<maxx;
    else
        out<<maxim;
    return 0;
}