#include <bits/stdc++.h>

using namespace std;

ifstream fin("cerere.in");
ofstream fout("cerere.out");
int n, i, s, k[100002];
int r[100002], x, y;
vector<int> a[100002], c;
bool fr[100002];

static inline void parc(int x) {
    fr[x] = 1;
    c.push_back(x);
    if(!k[x]) r[x] = 0;
    else r[x] = r[c[c.size() - 1 - k[x]]] + 1;

    for(auto it : a[x]) {
        if(!fr[it]) parc(it);
    }

    c.pop_back();
}

int main() {
    fin >> n;
    for(i = 1; i <= n; i++) fin >> k[i];

    s = n * (n + 1) / 2;
    for(i = 1; i < n; i++) {
        fin >> x >> y;
        a[x].push_back(y);
        a[y].push_back(x);
        s -= y;
    }

    parc(s);

    for(i = 1; i <= n; i++) fout << r[i] << " ";

    return 0;
}