#include <bits/stdc++.h>
using namespace std;
ifstream fin("asmax.in");
ofstream fout("asmax.out");

int n, v[16001], viz[16001], suma[16001], maxim;
vector <int> G[16001];

void DFS(int nod)
{
    viz[nod] = 1;
    suma[nod] += v[nod];
    for (auto next : G[nod])
        if (viz[next] == 0)
    {
        DFS(next);
        suma[nod] += suma[next];
        maxim = max(maxim, suma[nod]);
    }
}

int main()
{
    int i, x, y;
    fin >> n;
    for (i = 1 ; i <= n ; i++)
        fin >> v[i];
    for (i = 1 ; i < n ; i++)
    {
        fin >> x >> y;
        G[x].push_back(y);
    }
    maxim = -1;
    DFS(4);
    fout << maxim;
    return 0;
}