#include<fstream>
#include<vector>
#define Nmax 100001
using namespace std;

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

vector <int> V[Nmax];
int sol[Nmax], K[Nmax], root;
int st[Nmax];

void dfs(int nod, int k)
{
	int i;
	st[nod] = k;
	if (K[nod])
		sol[nod] = sol[st[nod] - K[nod]] + 1;
	for (i = 0; i < V[nod].size(); ++i)
		dfs(V[nod][i], k + 1);
}

int main()
{
	int x, y, N, i;
	fin >> N;
	for (i = 1; i <= N; ++i)
		fin >> K[i];
	root = N;
	for (i = 1; i <= N; ++i)
	{
		fin >> x >> y;
		V[x].push_back(y);
		root ^= y ^ i;
	}
	dfs(root, 0);
	for (i = 1; i <= N; ++i)
		fout << sol[i] << ' ';
	fout << '\n';
	fin.close();
	fout.close();
	return 0;
}