/*
  Lefter Sergiu - 09/03/2023
*/
#include <fstream>
#include <vector>

using namespace std;

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

const int N = 16000;

int n, x, y, val[N+1], viz[N+1], suma[N+1], maxi;
vector<int> fii[N+1];

void DFS(int nod) {
    viz[nod] = 1;
    suma[nod] = val[nod];
    for (auto i: fii[nod]) {
        if (!viz[i]) {
            DFS(i);
            suma[nod] += suma[i];
        }
    }
}

int main() {
    in >> n;
    for (int i = 1; i <= n; ++i) {
        in >> val[i];
    }
    while (in >> x >> y) {
        fii[x].push_back(y);
        fii[y].push_back(x);
    }
    DFS(1);
    for (int i = 1; i <= n; ++i) {
        maxi = max(maxi, suma[i]);
    }
    out << maxi;
    in.close();
    out.close();
    return 0;
}