#include <cstdio>

using namespace std;

#define N 100001

#define dim 8192
char ax[dim];
int pz;

void cit(int &x) {
	x = 0;
	while (ax[pz] < '0' || ax[pz] > '9')
		if (++pz == dim)
			fread(ax, 1, dim, stdin), pz = 0;
	while (ax[pz] >= '0' && ax[pz] <= '9') {
		x = x * 10 + ax[pz] - '0';
		if (++pz == dim)
			fread(ax, 1, dim, stdin), pz = 0;
	}
}

struct nod {
	int v;
	nod *next;
};

nod *a[N];

int parent[N];

int st[N];
int n;

int g[N];
int root = 0;
bool used[N];
int nst;

int sol[N];

void add(int p, int q) {
	nod *u = new nod;
	u->v = q;
	u->next = a[p];
	a[p] = u;
}

void dfs(int u) {
    used[u] = true;
    st[++nst] = u;

    if (nst - parent[u] >= 1 && parent[u] != 0)
        sol[u] = sol[ st[ nst - parent[u] ] ] + 1;

    for (nod *it = a[u]; it; it = it->next)
        if (!used[it->v]) {
            dfs(it->v);
        }

    --nst;
}


int main() {

    freopen ("cerere.in", "r", stdin);
    freopen ("cerere.out", "w", stdout);
    cit(n);
    int i;
    for (i = 1; i <= n; ++i)
       	cit(parent[i]);

    int p, q;

    for (i = 1; i < n; ++i) {
        cit(p); cit(q);
        add(p, q);
        g[q]++;
    }

    for (i =1 ;i <= n; ++i)
        if (!g[i])
            root = i;

    dfs(root);

    for (i = 1; i <= n; ++i)
        printf ("%d ", sol[i]);
    printf ("\n");
}