#include<cstdio>
#include<vector>
using namespace std;
int st[100005],k[100005],viz[100005],u,dp[100005];
vector<int>g[100005];
int dfs(int nod){
int lim=g[nod].size(),i;
st[++u]=nod;
for(i=0;i<lim;i++){
if (k[g[nod][i]]==0)
dp[g[nod][i]]=0;
else
dp[g[nod][i]]=dp[st[u-k[g[nod][i]]+1]]+1;
dfs(g[nod][i]);}
u--;}
int main(){
freopen("cerere.in","r",stdin);
freopen("cerere.out","w",stdout);
int n,i,x,y;
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d",&k[i]);
for(i=1;i<n;i++){
scanf("%d%d",&x,&y);
viz[y]=1;
g[x].push_back(y);}
for(i=1;i<=n;i++)
if (viz[i]==0)
break;
dfs(i);
for(i=1;i<=n;i++)
printf("%d ",dp[i]);
return 0;}