#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

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

const int NMAX = 16003;

vector<int> g[NMAX];
int val[NMAX], s[NMAX], res;
bool vis[NMAX];

void dfs(int nod) {
    vis[nod] = true;
    s[nod] += val[nod];

    for (auto v : g[nod]) {
        if (!vis[v]) {
            dfs(v);
            if (s[v] > 0)
                s[nod] += s[v];
        }
    }
    if (s[nod] > res)
        res = s[nod];
}

int main() {

    int n;
    fin >> n;
    for (int i = 1; i <= n; i++) {
        fin >> val[i];
        if (val[i] > res)
            res = val[i];
    }

    for (int i = 1; i <= n - 1; i++) {
        int x, y;
        fin >> x >> y;
        g[x].push_back(y);
        g[y].push_back(x);
    }

    dfs(1);
    fout << res;

    return 0;
}