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

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

int cost[16001];
vector<int> liste[16001];

int DFS(int x){
    int sum=cost[x];
    for (vector<int>::iterator i=liste[x].begin();i!=liste[x].end();i++){
        int rezultat=DFS(*i);
        if (rezultat+sum>rezultat)
            sum+=rezultat;
    }
    return sum;
}

int main(){
    int n;
    in>>n;
    int x1,x2;
    for (int i=1;i<=n;i++)
        in>>cost[i];
    for (int i=1;i<=n-1;i++){
        in>>x1>>x2;
        if (x1>x2){int aux=x1;x1=x2;x2=aux; }
        liste[x1].push_back(x2);
    }
    int max=-10001;
    for (int i=1;i<=n;i++){
        int result=DFS(i);
        if (max<result)
            max=result;
    }
    out<<max;
    return 0;
}