#include <fstream>
#include <vector>
using namespace std;
ifstream fi("cerere.in");
ofstream fo("cerere.out");
vector<int> G[100010];
int K[100010],rez[100010],dst[100010],vf=1,N,x,y;
char is[100010];
void dfs(int nod){
	dst[++vf]=nod;
	if (K[nod]==0) rez[nod]=0; else rez[nod]=rez[dst[vf-K[nod]]]+1;
	for (unsigned int i=0;i<G[nod].size();++i) dfs(G[nod][i]);
	--vf;
}
int main(){
	fi>>N;
	for (int i=1;i<=N;++i) fi>>K[i];
	for (int i=1;i<N;++i){
		fi>>x>>y;
		G[x].push_back(y);
		++is[y];
	}
	for (int i=1;i<=N;++i) if (!is[i])dfs(i);
	for (int i=1;i<=N;++i) fo<<rez[i]<<" ";
	fo<<"\n";fo.close();
	return 0;
}