#include <bits/stdc++.h>

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

std::vector <int> v[16001];
bool viz[16001];
int a[16001], n, m, t, i, x, y, smax = INT_MIN;

void dfs(int nod)
{
    viz[nod] = 1;
    for(std::vector<int>::iterator it = v[nod].begin(); it != v[nod].end(); ++ it)
    {
        if(!viz[*it])
        {
            a[nod] = a[nod] + a[*it];
            dfs(*it);
        }
    }
}
int main()
{
    f >> n;
    for(i = 1; i <= n; ++ i)
    {
        f >> a[i];
    }
    for(i = 1; i < n; ++ i)
    {
        f >> x >> y;
        v[x].push_back(y);
        v[y].push_back(x);
    }
    for(i = 1; i <= n; ++ i)
    {
        if(!viz[i])
            dfs(i);
    }
    for(i = 1; i <= n; ++ i)
    {
        if(a[i] > smax)
            smax = a[i];
    }
    g << smax << "\n";

    return 0;
}