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

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

const int MAXN = 100006;

vector<int> fii[MAXN];
int k[MAXN];
int n;

bool are_tata[MAXN];

void citire()
{
    in >> n;
    for (int i = 1;i <= n;++i)
        in >> k[i];
    for (int i = 1;i < n;++i)
    {
        int a,b;
        in >> a >> b;
        are_tata[b] = true;
        fii[a].push_back(b);
    }
}

int stiva[MAXN];
int l_stiva;

int rasp[MAXN];
int indice_fiu[MAXN];

void prelucrare()
{
    for (int i = 1;i <= n;++i)
    {
        rasp[i] = -1;
        indice_fiu[i] = -1;
        if (!are_tata[i])
            stiva[l_stiva = 1] = i;
    }

    while(l_stiva >= 1)
    {
        //calculare raspuns pentru acest nod
        int nod = stiva[l_stiva];
        if (rasp[nod] == -1)
        {
            rasp[nod] = 0;
            for (int i = l_stiva;k[stiva[i]] != 0;i -= k[stiva[i]])
                ++rasp[nod];
        }

        ++indice_fiu[nod];
        if(indice_fiu[nod] < fii[nod].size())
            stiva[++l_stiva] = fii[nod][indice_fiu[nod]];
        else --l_stiva;
    }
}

inline void afisare()
{
    for (int i = 1;i < n;++i)
        out << rasp[i] << ' ';
    out << rasp[n] << '\n';
}

int main()
{
    citire();
    prelucrare();
    afisare();
    return 0;
}