#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)
using namespace std;

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

const int mxN = 1e5 + 5, INF = 1e9 + 7;

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

int N, K[mxN], tata[mxN], ans[mxN];

void dfs(int node) {
    int memo_node = node;
    for (int i = 1; i <= K[memo_node]; ++i) {
        node = tata[node];
    }
    if (ans[node] == INF) {
        dfs(node);
    }
    ans[memo_node] = 1 + ans[node];
}

void solve() {
    fin >> N;
    FOR(i, 1, N) {
        fin >> K[i];
        ans[i] = (K[i] == 0 ? 0 : INF);
    }
    FOR(i, 1, N - 1) {
        int x, y;
        fin >> x >> y;
        tata[y] = x;
    }
    FOR(i, 1, N) {
        if (ans[i] == INF) {
            dfs(i);
        }
        fout << ans[i] << " ";
    }
}

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