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

#define NMax 100005
#define sz st[0]
#define nod st[sz]

ifstream f("cerere.in");
ofstream g("cerere.out");

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

void DFS(int s)
{
    int i;
    bool ok;
    viz[s] = true;
    st[++sz] = s;
    while(sz)
    {
        ok = false;
        for(i=0;i<v[nod].size();++i) if(!viz[v[nod][i]])
        {
            if(K[v[nod][i]]) sol[v[nod][i]] = sol[st[sz-K[v[nod][i]]+1]] + 1;
            else sol[v[nod][i]] = 0;

            ok = true;
            viz[v[nod][i]] = true;
            st[sz+1] = v[nod][i];
            sz++;
            break;
        }
        if(ok == false) sz--;
    }
}

int tata[NMax];

int main()
{
    int i,a,b;

    f>>N;
    for(i=1;i<=N;++i) f>>K[i];
    for(i=1;i<N;++i)
    {
        f>>a>>b;
        v[a].push_back(b);
        v[b].push_back(a);
        tata[b] = a;
    }

    for(i=1;i<=N;++i) if(!tata[i])
    {
        DFS(i);
        break;
    }

    for(i=1;i<=N;++i) g<<sol[i]<<" "; g<<"\n";

    f.close();
    g.close();
    return 0;
}