#include <iostream>
#include <fstream>
#include <vector>
#include <deque>
#define NMAX 100005

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

int n,i,j,a,b,k[NMAX],rz[NMAX];
bool vz[NMAX];
vector<int> vc[NMAX];
deque<int> q;

void dfs(int n)
{
	q.push_front(n);
	if(k[n]==0)	rz[n]=0;
	else rz[n]=rz[q[k[n]]]+1;
	
	for(int i=0;i<vc[n].size();i++)
		dfs(vc[n][i]);
	q.pop_front();
}
int main() {
	
	fin>>n;
	for(i=1;i<=n;i++)
		fin>>k[i];
	for(i=1;i<n;i++)
	{
		fin>>a>>b;
		vc[a].push_back(b);
		vz[b]=1;
	}
	for(i=1;i<=n;i++)
		if(vz[i]==0)	a=i;
	
	dfs(a);
	for(i=1;i<=n;i++)
		fout<<rz[i]<<" ";	fout<<"\n";
}