#include<stdio.h>
#include<vector>
#define pb push_back
#define maxn 100005
using namespace std;

int n,m,root,u;
int v[maxn],t[maxn],sol[maxn],uz[maxn];
int stack[maxn];
vector <int> l[maxn];

void read()
{
    int i;
    int x,y;
    scanf("%d",&n);
    for(i=1;i<=n;i++) scanf("%d",&t[i]);
    for(i=1;i<n;i++)
    {
        scanf("%d%d",&x,&y);
        uz[y]=1;
        l[x].pb(y);
        l[y].pb(x);
    }
    for(i=1;i<=n;i++) if(uz[i]==0) root=i;
}

void dfs(int k)
{
    v[k]=1; stack[++u]=k;
    if(t[k]) sol[k]=sol[stack[u-t[k]]]+1;
    else sol[k]=0;
    for(unsigned int i=0;i<l[k].size();i++)
     if(v[l[k][i]]==0)
      dfs(l[k][i]);
    u--;
}

void print()
{
    for(int i=1;i<=n;i++) printf("%d ",sol[i]);
}

int main()
{
    freopen("cerere.in","r",stdin);
    freopen("cerere.out","w",stdout);

    read();
    dfs(root);
    print();

    fclose(stdin);
    fclose(stdout);
    return 0;
}