#include <fstream>
#include <vector>
#include <cassert>

int sol[100001], destepti[100001];
std::vector<int> edges[100001];
bool viz[100001], are_parinte[100001];
int st[100000], top;

void dfs(int i) {
	assert(viz[i] == false);
	viz[i] = true;
	st[top++] = i;
	if (destepti[i] > 0) {
		sol[i] = sol[st[top - destepti[i] - 1]] + 1;
	}
	for (const auto fiu : edges[i]) {
		dfs(fiu);
	}
	top--;
}

int main() {
	std::ifstream fin("cerere.in");
	std::ofstream fout("cerere.out");
	int n;

	fin >> n;
	for (int i = 1; i <= n; i++) {
		fin >> destepti[i];
	}
	for (int i = 0; i < n - 1; i++) {
		int a, b;
		fin >> a >> b;
		edges[a].push_back(b);
		are_parinte[b] = true;
	}

	int tati = 1;
	while (tati <= n && are_parinte[tati] == true) {
		tati++;
	}
	dfs(tati);
	for (int i = 1; i <= n; i++) {
		fout << sol[i] << ' ';
	}

	return 0;
}