#include <cstdio>
#include <vector>
#define MAXN 100003
using namespace std;

int i, N, M, j, A, B, head, x;
int K[MAXN], ANC[MAXN], st[MAXN], Mk[MAXN], sol[MAXN];
vector <int> v[MAXN];
bool used[MAXN], t[MAXN];

inline void DFS(int nod) {
	used[nod] = true;
	st[++head] = nod;
	ANC[nod] = st[head - K[nod]];
	sol[nod] = Mk[ANC[nod]] + 1;
	if (K[nod] == 0) Mk[nod] = 0, sol[nod] = 0;
	vector <int> :: iterator it, fin;
	it = v[nod].begin(); fin = v[nod].end();
	for (; it != fin; ++it) {
		if (!used[*it]) {
			Mk[*it] = Mk[nod] + 1;
			DFS(*it);
		}
	}
	--head;
}
int main() {
	freopen("cerere.in","r",stdin);
	freopen("cerere.out","w",stdout);
	scanf("%d", &N); M = N - 1;
	for (i = 1; i <= N; ++i) scanf("%d", &K[i]);
	while (M--) {
		scanf("%d%d", &A, &B);
		v[A].push_back(B);
		v[B].push_back(A);
		t[B] = true;
	}
	for (i = 1; i <= N; ++i)
		if (!t[i]) break;
	DFS(i);
	for (i = 1; i <= N; ++i)
		printf("%d ", sol[i]);
	printf("\n");
	return 0;
}