#include <fstream>
#include <deque>
#include <algorithm>

using namespace std;

ifstream fin("cerere.in");
ofstream fout("cerere.out");

deque <int> l[100005];

int d[100005],k[100005],af[100005];
bool v[100005];

void dfs(int nod, int niv)
{
    v[nod]=1;
    d[niv]=nod;
    int cm=d[niv];
    int cn=niv;
    int nr=0;
    while (k[cm]!=0)
    {
        cn-=k[cm];
        cm=d[cn];
        nr++;
    }
    af[nod]=nr;
    for (int i=0;i<l[nod].size();i++)
    {
        int vec=l[nod][i];
        if (v[vec]==0)
        {
            dfs(vec,niv+1);
        }
    }
}

int n,r,i,x,y;

int main()
{
    fin >> n;
    for (i=1;i<=n;i++)
    {
        fin >> k[i];
        if (k[i]==0) r=i;
    }
    for (i=1;i<n;i++)
    {
        fin >> x >> y;
        l[x].push_back(y);
        l[y].push_back(x);
    }
    dfs(r,1);
    for (i=1;i<=n;i++) fout << af[i] << " ";

    return 0;
}