#include <fstream>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;

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

const int MAXN = 16005;
int n;
int s[MAXN], c[MAXN];
bool f[MAXN];
vector<int> v[MAXN];
int vf[MAXN];

void dfs(int k) {

    for (int i = 0; i < v[k].size(); ++i) {
        if (f[v[k][i]] == 0) {
            f[v[k][i]] = 1;
            dfs(v[k][i]);
        }
    }

    int sm = c[k];
    for (int i = 0; i < v[k].size(); ++i) {
        if (s[v[k][i]] > 0) {
            sm += s[v[k][i]];
        }
    }
    s[k] = sm;
}

int main() {

    fin >> n;
    for (int i = 1; i <= n; ++i) {
        fin >> c[i];
    }
    for (int i = 1; i < n; ++i) {
        int a, b;
        fin >> a >> b;
        vf[b]++;
        v[a].push_back(b);
    }

    for (int i = 1; i <= n; ++i) {
        if (vf[i] == 0) {
            dfs(i);
            i = n + 10;
        }
    }

    int sol = s[1];
    for (int i = 2; i <= n; ++i) {
        sol = max(sol, s[i]);
    }
    fout << sol;

    fout.close();
    return 0;
}