#include<bits/stdc++.h>
#define maxN 100005
using namespace std;
int seen[maxN],t[maxN],k[maxN],sol[maxN],n,x,y;
vector<int> v[maxN];
void dfs(int nod,int niv)
{
    seen[nod]=1;
    t[niv]=nod;
    if(k[nod]) sol[nod]=1+sol[t[niv-k[nod]]];
        else sol[nod]=0;
    for(vector<int>::iterator it=v[nod].begin();it!=v[nod].end();it++)
    {
        if(!seen[*it])
            dfs(*it,niv+1);
    }
}
int main()
{
    freopen("cerere.in","r",stdin);
    freopen("cerere.out","w",stdout);
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
        scanf("%d",&k[i]);
    for(int i=1;i<n;i++)
    {
        scanf("%d%d",&x,&y);
        v[x].push_back(y);
        v[y].push_back(x);
    }
    dfs(1,1);
    for(int i=1;i<=n;i++)
    {
        printf("%d ",sol[i]);
    }
    return 0;
}