#include <cstdio>
#include <vector>
using namespace std;

#define NMax 100005

int N,K[NMax];
vector<int> v[NMax];
int st[NMax];
int viz[NMax];
int sol[NMax];

void DFS(int x,int poz)
{
    viz[x] = true;
    st[poz] = x;
    for(int i=0;i<v[x].size();++i) if(!viz[v[x][i]])
    {
        if(K[v[x][i]]) sol[v[x][i]] = sol[st[poz+1-K[v[x][i]]]]+1;
        else sol[v[x][i]] = 0;
        DFS(v[x][i],poz+1);
    }
}

int tata[NMax];

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

    int i,a,b;

    scanf("%d",&N);
    for(i=1;i<=N;++i) scanf("%d",&K[i]);

    int root = N*(N+1)/2;

    for(i=1;i<N;++i)
    {
        scanf("%d %d",&a,&b);
        v[a].push_back(b);
        v[b].push_back(a);
        root -= b;
    }

    DFS(root,1);

    for(i=1;i<=N;++i) printf("%d ",sol[i]); printf("\n");

    return 0;
}