#include <fstream>
#include <vector>
#include <climits>
using namespace std;
#define NMAX 16005
ifstream cin("asmax.in");
ofstream cout("asmax.out");

int n, val[NMAX], viz[NMAX];
vector <int> arb[NMAX];

void dfs(int nod) {
    viz[nod] = 1;
    for (int i = 0; i < arb[nod].size(); i++) {
        if (viz[arb[nod][i]] == 0) {
            dfs(arb[nod][i]);
            if (val[arb[nod][i]] > 0) {
                val[nod] += val[arb[nod][i]];
            }
        }
    }
}

int main()
{
    cin>>n;
    int maxim = INT_MIN;
    for (int i = 1; i <= n; i++) {
        cin>>val[i];
    }
    for (int i = 1; i <= n - 1; i++) {
        int x, y;
        cin>>x>>y;
        arb[x].push_back(y);
        arb[y].push_back(x);
    }
    dfs(1);
    for (int i = 1; i <= n; i++) {
        if (val[i] > maxim) {
            maxim = val[i];
        }
    }
    cout<<maxim;
    return 0;
}