#include <iostream>
#include <fstream>
#include <vector>
#include <stack>

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

const int Nmax = 100005;
int n, k[Nmax], Use[Nmax], sol[Nmax],tata[Nmax] , log2[Nmax], s[Nmax], sn;
vector <int> G[Nmax];

void DFS(int nod)
{
    Use[nod] = 1;
    for(int i = 0; i < (int)G[nod].size(); i++)
    {
        int vecin = G[nod][i];
        s[++sn] = vecin;
        int stramos = s[sn - k[vecin]];
        if(vecin != stramos) sol[vecin] = sol[stramos] + 1;
        DFS(vecin);
        sn--;
    }
}

int main()
{
    f>>n;
    for(int i = 1; i <= n; i++) f>>k[i];
    for(int i = 1; i < n; i++)
    {
        int x,y;
        f>>x>>y;
        G[x].push_back(y);
        tata[y] = x;
    }
    for(int i = 1; i <= n; i++)
    {
        if(tata[i] == 0)
        {
            s[++sn] = i;
            DFS(i);
            i = n+1;
        }
    }
    for(int i = 1; i <= n; i++)
    {
        g<<sol[i]<<' ';
    }
    return 0;
}