#include <fstream>
#include <vector>
#include <bitset>
using namespace std;

ifstream f("asmax.in");
ofstream g("asmax.out");

bitset < 16005 > viz;
vector < int > a[16002];
int n, v[16002], cost[16002], sol=-(1<<20);

void dfs(int nod)
{
    viz[nod]=1; cost[nod]=v[nod];
    for (int i=0; i<a[nod].size(); i++)
        if (!viz[a[nod][i]])
        {
            dfs(a[nod][i]);
            if (cost[a[nod][i]]>0)
                cost[nod]+=cost[a[nod][i]];
            if (cost[nod]>sol) sol=cost[nod];
        }
}

int main()
{
    f>>n;
    for (int i=1; i<=n; i++) f>>v[i];
    for (int i=1; i<n; i++)
    {
        int x, y; f>>x>>y;
        a[x].push_back(y); a[y].push_back(x);
    }
    dfs(1); g<<sol<<'\n';
    return 0;
}