#include <bits/stdc++.h>

using namespace std;

ifstream fin("asmax.in");
ofstream fout("asmax.out");

int n, m;
vector<int> pret(16003);
vector<int> h[16003];
vector<int> sol(16003);

int dist(int nod)
{
    if(h[nod].size() == 0)
    {
        sol[nod] = pret[nod];
        return pret[nod];
    }

    int s = 0;
    for(auto v : h[nod])
        s += dist(v);
    sol[nod] = s;
    return s;
}

int main()
{
    int start, p, x, y, mx;
    fin >> n;
    for(int i = 1; i <= n; i++)
        fin >> pret[i];

    fin >> start >> y;
    h[start].push_back(y);
    for(int i = 2; i <= n; i++)
    {
        fin >> x >> y;
        h[x].push_back(y);
    }

    dist(start);

    mx = 0;
    for(int i = 1; i <= n; i++)
        mx = max(mx, sol[i]);
    fout << mx << " ";

    fin.close();
    fout.close();
    return 0;
}