#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 + 5;

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

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

void solve() {
    fin >> N;
    for (int i = 1; i <= N; ++i) {
        fin >> K[i];
        ans[i] = INF;
    }
    for (int i = 1; i <= N - 1; ++i) {
        int x, y;
        fin >> x >> y;
        tata[y] = x;
    }
    for (int i = 1; i <= N; ++i) {
        if (!K[i]) {
            ans[i] = 0;
            fout << ans[i] << " ";
            continue;
        }
        int memo_i = i;
        int cnt = 0;
        while (ans[memo_i] == INF) {
            for (int j = 1; j <= K[i]; ++j) {
                memo_i = tata[memo_i];
            }
            cnt++;
        }
        ans[i] = cnt + ans[memo_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;
}