// Source: https://usaco.guide/general/io

#include <bits/stdc++.h>
using namespace std;

const int NMAX = 16000;
int dp[NMAX + 1];
vector<int> G[NMAX + 1];
int val[NMAX + 1];

void dfs(int node, int parent) {
    dp[node] = val[node];
    vector<int> fii;
    for(auto vec : G[node]) {
        if(vec != parent) {
            fii.push_back(vec);
            dfs(vec, node);
        }
    }
    for(auto fiu : fii) {
        if(dp[fiu] > 0) {
            dp[node] += dp[fiu];
        }
    }
}

int main() {
    ifstream cin("asmax.in");
    ofstream cout("asmax.out");
	int n;
    cin >> n;
    for(int i = 1; i <= n; i++) {
        cin >> val[i];
    }
    for(int i = 1; i < n; i++) {
        int x, y;
        cin >> x >> y;
        G[x].push_back(y);
        G[y].push_back(x);
    }
    dfs(1, 0);
    int sol = dp[1];
    for(int i = 2; i <= n; i++) {
        sol = max(sol, dp[i]);
    }
    cout << sol;
}