#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

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

vector<vector<int>> adjacentList;
vector<int> costs;
vector<int> visited;


int dfsAsmax(int node, int &maxi) {
    int s = costs[node];
    visited[node] = 1;

    for (int i = 0; i < adjacentList[node].size(); ++i) {
        if (!visited[adjacentList[node][i]]) {
            int suma = dfsAsmax(adjacentList[node][i], maxi);
            if (s + suma > s)
                s += suma;
        }
    }

    if (s > maxi)
        maxi = s;

    return s;
}

int main() {
    int n, x, y, maxi = -1001, answer;
    f >> n;

    adjacentList.resize(n + 1);
    costs.resize(n + 1);
    visited.resize(n + 1, 0);

    for (int i = 1; i <= n; ++i)
        f >> costs[i];

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

    answer = dfsAsmax(1, maxi);
    g << maxi;

    f.close();
    g.close();
    return 0;
}