#include<iostream>
#include<fstream>
#include<vector>
#include<queue>
#include<stack>
using namespace std;

vector <int> v[100001];
vector <int> viz(100001, 0);
vector <int> niv(100001, 0);
vector <int> sol(100001, 0);

void dfs(int top, int *a, int n)
{
	viz[top] = 1;
	n++;
	niv[n] = top;
	if (a[top] != 0 && n - a[top] >= 0)
		sol[top] = sol[niv[n - a[top]]] + 1;
	for (int i = 0; i < v[top].size(); i++)
	if (viz[v[top][i]] == 0)
		dfs(v[top][i], a, n);
	//for (int i = 0; i <= 12; i++) cout << niv[i] << " "; cout << "\n";
	niv[n] = 0;
}
int main()
{

	ifstream f("cerere.in");
	ofstream g("cerere.out");
	int n, i, j;
	f >> n;
	int *a = new int[n + 1];
	for (i = 1; i <= n; i++) {
		f >> a[i];
	}
	while (!f.eof()) {
		f >> i >> j;
		v[i].push_back(j);
	}

	dfs(1, a, -1);

	for (int i = 1; i <= n; i++)
		g << sol[i] << " ";

	//cin.get();
	f.close();
	g.close();
	return 0;
}