#include <algorithm>
#include <fstream>
#include <vector>
#include <stack>

using namespace std;

ifstream f("asmax.in");
ofstream g("asmax.out");

const int mare = 16000, fmare = 16000000;
vector <int> ls[16005];
int n, i, x, y;
int a[16005], nmin = mare;
int sf[16005] = {-fmare}, smax = -fmare;
bool viz[16005];

void df(int k){
    int i, l = ls[k].size();
    viz[k] = 1;
    bool var = 0;
    for (i = 0; i < l; i++){
        if (viz[ls[k][i]] == 0){
            var = 1;
            if (sf[ ls[k][i] ] + sf[k] > sf[k])
                sf[k] = sf[k] + sf[ ls[k][i] ];
            df(ls[k][i]);
        }
    }
}

int main(){
    f >> n;
    for (i = 1; i <= n; i++){
        f >> a[i];
        sf[i] = a[i];
    }
    for (i = 1; i <= n-1; i++){
        f >> x >> y;
        ls[x].push_back(y);
        ls[y].push_back(x);
        nmin = min(nmin, x);
        nmin = min(nmin, y);
    }
    df(nmin);
    for (i = 1; i <= n; i++)
        if (smax < sf[i])
            smax = sf[i];
    g << smax;
    return 0;
}