#include<fstream.h>
#include<vector>
const long NMAX=100005;
using namespace std;
vector<int> a[NMAX];
long r,n,k[NMAX],v[NMAX],st[NMAX],nr;
void dfs(long p)
{long i;
 v[p]=0;
 st[++nr]=p;
  if(k[p]!=0)
	  k[p]=1+k[st[nr-k[p]]];
  for(i=0;i<a[p].size();++i)
	  if(v[a[p][i]] )
		  dfs(a[p][i]);
  --nr;
}
int main()
{ifstream fin("cerere.in");
 ofstream fout("cerere.out");
  fin>>n;
  long i,y,x;
	   for(i=1;i<=n;++i)
		fin>>k[i];
	   for(i=1;i<=n-1;++i)
	   {fin>>x>>y;
	    a[x].push_back(y);v[y]=1;
	   }
	  for(i=1;i<=n;++i)
		if(v[i]==0)
			break;
	
    dfs(i);		
  for(i=1;i<=n;++i)
	  fout<<k[i]<<' ';
  fout<<'\n';
 fout.close();
 return 0;
}