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

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

#define N 16001

int n, val[N], viz[N];
vector<int> a[N];

int dfs(int x){
    viz[x] = 1;

    int sum = 0;
    for(int k : a[x]){
        if(viz[k] == 0){
            int res = dfs(k);
            if(res > 0)
                sum += res;
        }
    }

    return sum + val[x];
}

int main(){
    int maxval = -1001, maxnod = 1;
    in >> n;
    for(int i=1; i<=n; i++){
        in >> val[i];
        if(val[i] > maxval){
            maxval = val[i];
            maxnod = i;
        }
    }

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

    out << dfs(maxnod);
}