#include <stdio.h>
#include <vector>
#include <queue>
#include <list>
#include <set>
#include <algorithm>
#include <utility>
#include <string>
using namespace std;
#define FOR(i,a,b) for (typeof a i=a;i<=b;i++)
#define fori(it,v) for (typeof ((v).begin()) it=(v).begin();it!=(v).end();it++)
#define pb push_back
#define mp make_pair
#define fs first
#define ss second
#define all(c) c.begin(),c.end()
int log[30],put[100005],b[30][100005],sol[100005],stra[100005],k[100005];
int chestie(int z)
{
	int x,y;
	if (!sol[z]&&k[z])
	{
		x=k[z];
		y=z;
		while (x)  
		{  
			y=b[put[x]][y];  
			x-=log[put[x]];
	       	} 
	//	printf("Al %d stramos al lui %d e %d\n",k[z],z,y);
		sol[z]=1+chestie(y);
		return sol[z];
	}	
	return sol[z];
}
int main()
{
	FILE *in,*out;
	int n,x,y;
	in=fopen("cerere.in","r");
	out=fopen("cerere.out","w");
	fscanf(in,"%d",&n);
	FOR(i,1,n)
		fscanf(in,"%d",&k[i]);
	FOR(i,1,n-1)
	{
		fscanf(in,"%d%d",&x,&y);
		stra[y]=x;
	}
	put[1]=0;
	x=2;
	y=1;
	FOR (i,2,n)
	{
		if (i==x)
		{
			x*=2;
			++y;
		}
		put[i]=y-1;
	
	}
	log[0]=1;
	FOR(i,1,put[n])
		log[i]=2*log[i-1];
	FOR(i,1,n)
		b[0][i]=stra[i];
	FOR(i,1,put[n])
	{
		FOR(j,1,n)
			b[i][j]=b[i-1][b[i-1][j]];
	}
	FOR(i,1,n)
	{
		sol[i]=chestie(i);
	//	if (!k[i])
	//		sol[i]--;
	}
	FOR(i,1,n)
		fprintf(out,"%d ",sol[i]);
	fprintf(out,"\n");
	fclose(in);
	fclose(out);
	return 0;
}