#include <bits/stdc++.h>
#define ll long long
#define nl '\n'
#define FOR(i, a, b) for (int i = a; i <= b; ++i) 
#define F0R(i, a, b) for (int i = a; i >= b; --i)
#define FORd(i, n) for (int i = 0; i < n; ++i)
#define F0Rd(i, n) for (int i = n - 1; i >= 0; --i)
#define trav(a, x) for (auto &a : x)
#define uid(a, b) uniform_int_distribution<int>(a, b)(rng)
#define all(x) x.begin(), x.end()
using namespace std;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int mxN = 1e5 + 5;

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

int n, k[mxN], tata[mxN], ans[mxN], root;
vector<int> edges[mxN], stramosi;

void dfs(int node) {
    if (k[node]) {
        ans[node] = ans[stramosi[stramosi.size() - k[node]]] + 1;
    }
    stramosi.push_back(node);
    for (int vecin : edges[node]) {
        if (vecin == tata[node]) continue;
        dfs(vecin);
    }
    stramosi.pop_back();
}

void solve() {
    fin >> n;
    for (int i = 1; i <= n; ++i) {
        fin >> k[i];
    }
    for (int i = 1; i < n; ++i) {
        int x, y;
        fin >> x >> y;
        tata[y] = x;
        edges[x].push_back(y);
    }
    for (int i = 1; i <= n; ++i) {
        if (tata[i] == 0) {
            root = i; 
            break;
        }
    }
    dfs(root);
    for (int i = 1; i <= n; ++i) {
        fout << ans[i] << " ";
    }
}

int main() {
    fin.tie(0)->sync_with_stdio(0); fout.tie(0);
    int T = 1;
//    cin >> T;
    while (T--) {
        solve();
    }
    return 0;
}

//read the question correctly (ll vs int)
//what's the meaning of the problem ? Think outside the BOX !!!
//edge cases ?
//make it simple
// write everything (observations, edge cases, ideas, steps, methods, ...)