#include <cstdio>

using namespace std;

int num, v[1001], viz[16001], sum[16001], urm[1001], vf[1001], lst[16001], m, maxim = -170000;

void dfs(int x)
{
    int y, p;
    viz[x] = true;
    p = lst[x];
    while(p != 0)
    {
        y = vf[p];
        if(!viz[y])
        {
            dfs(y);
            if(sum[y] > 0)
                sum[x] += sum[y];
        }
        p = urm[p];
    }
    if(sum[x] > maxim)
        maxim = sum[x];
}

inline void adauga(int x, int y)
{
    ++m;
    vf[m] = y;
    urm[m] = lst[x];
    lst[x] = m;
}

int main()
{
    FILE *in, *out;
    in = fopen("asmax.in", "r");
    out = fopen("asmax.out", "w");
    int i, n, x, y;
    fscanf(in, "%d", &n);
    for(i = 1; i <= n; i++)
    {
        fscanf(in, "%d", &sum[i]);
    }
    for(i = 1; i < n; i++)
    {
        fscanf(in, "%d", &x);
        fscanf(in, "%d", &y);
        adauga(x, y);
    }
    dfs(1);
    fprintf(out, "%d", maxim + 1);
    return 0;
}