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

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

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