#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <climits>
#include <bitset>
using namespace std;

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

const int MAX_SIZE = 16005;
int peaks, arches, totalCost;
int isIterated[MAX_SIZE];
int costs[MAX_SIZE], sums[MAX_SIZE];
vector<int> graph[MAX_SIZE];

void findMaxSum(int curPoint) {
    sums[curPoint] = costs[curPoint];
    isIterated[curPoint] = 1;
    for (int nextPoint : graph[curPoint]) {
        if (isIterated[nextPoint] == 0) {
            findMaxSum(nextPoint);
            if (isIterated[nextPoint] == 1 && sums[nextPoint] > 0) {
                sums[curPoint] += sums[nextPoint];
            }
        }
    }
}

int main() {
    fin >> peaks;
    for (int i = 1; i <= peaks; ++i) {
        fin >> costs[i];
    }
    for (int i = 1; i < peaks; ++i) {
        int start, end;
        fin >> start >> end;
        graph[start].push_back(end);
        graph[end].push_back(start);
    }
    findMaxSum(1);
    int maxSum = -INT_MAX;
    for (int i = 1; i <= peaks; ++i) {
        //cout << sums[i] << " ";
        maxSum = max(maxSum, sums[i]);
    }
    fout << maxSum;
    return 0;
}