#include<stdio.h>
#include<vector>
using namespace std;

vector <int> v[100002];
int n,k[100002],t[100002],sol[100002],s[100002],a[100002];

void dfs(int x)
{
    int l=1,aux;
    while(l>=1)
    {
        s[l]=x;
        if(k[x]==0)
            sol[x]=0;
        else
        {
            aux=l-k[x];
            sol[x]=1+sol[s[aux]];
        }
        if(a[x]<v[x].size())
        {
            x=v[x][a[x]++];
            ++l;
        }
        else
        {
            x=t[x];
            --l;
        }
    }
}

int main()
{
    freopen("cerere.in","r",stdin);
    freopen("cerere.out","w",stdout);
    int 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);
        v[x].push_back(y);
        t[y]=x;
    }
    for(i=1;i<=n;++i)
        if(t[i]==0)
            break;
    dfs(i);
    for(i=1;i<=n;++i)
        printf("%d ",sol[i]);
    printf("\n");
    return 0;
}