#include<iostream>
#include<fstream>
#include<vector>

std::vector <int> v[100001];
std::vector <int> viz(100010, 0);
std::vector <int> sol(100010, 0);
void dfs(int top,int *a,int n)
{
	viz[top] = 1; 
	//std::cout << top << " " << n << " "<<a[top]<<'\n';
	if(n>=a[top]&&a[top]!=0) sol[top] = sol[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+1);
	n--;
}
using namespace std;
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,0);
	
	for (i = 1; i <= n; i++) g << sol[i] << " ";
	
	//cin.get();
	f.close();
	g.close();
	return 0;
}