#include <fstream>
#include <cstdio>
#include <vector>
#define Nmax 100001
using namespace std;

ofstream g("cerere.out");

int n,K[Nmax],str[Nmax],rez[Nmax],R;
bool uz[Nmax],viz[Nmax];
vector<int> V[Nmax],st;

void dfs(int nod)
{
    viz[nod] = 1;
    st.push_back(nod);
    str[nod] = st[st.size()-K[nod]-1];
    for (int i=0;i<V[nod].size();i++)
    {
        if (!viz[V[nod][i]])
            dfs(V[nod][i]);
    }
    st.pop_back();
}
int check(int nod)
{
    if (rez[nod]==0 && K[nod]!=0)
        rez[nod] = check(str[nod]);

    return rez[nod]+1;
}



int main()
{
    freopen("cerere.in","r",stdin);
    scanf("%d",&n);
    for (int i=1;i<=n;i++)
        scanf("%d",&K[i]);
    for (int i=1;i<n;i++)
    {
        int x,y;
        scanf("%d%d",&x,&y);
        uz[y] = 1;
        V[y].push_back(x);
        V[x].push_back(y);
    }

    for (int i=1;i<=n;i++)
    {
        if (uz[i]==0)
        {
            R =  i;
            break;
        }
    }

    dfs(R);

    for (int i=1;i<=n;i++)
    {
        if (rez[i]==0 && K[i]!=0)
            rez[i] = check(i)-1;
        g<<rez[i]<<' ';
    }

    return 0;
}