#include<fstream>
#include<vector>
#define L C.size()-1
#define NMAX 100005
using namespace std;
int n,v[NMAX],TT[NMAX],A[NMAX];
vector<int> G[NMAX],C;
inline void read()
{
	ifstream fin("cerere.in");
	fin>>n;
	int i,x,y;
	for(i=1;i<=n;i++)
		fin>>v[i];
	for(i=1;i<n;i++)
	{
		fin>>x>>y;
		TT[y]=x;
		G[x].push_back(y);
	}
	fin.close();
}
inline void DFS(int nod)
{
	C.push_back(nod);
	if(v[nod])
		A[nod]=A[C[L-v[nod]]]+1;
	for(size_t i=0;i<G[nod].size();i++)
		DFS(G[nod][i]);
	C.pop_back();
}
inline int TATA(int i)
{
	if(!TT[i])
		return i;
	return TATA(i+1);
}
inline void print()
{
	ofstream fout("cerere.out");
	for(int i=1;i<=n;i++)
		fout<<A[i]<<' ';
	fout.close();
}
int main()
{
	read();
	DFS(TATA(1));
	print();
	return 0;
}