#include <fstream>
#include <vector>
#define DIM 100005

using namespace std;

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

int n,i,x,y,k[DIM],v[DIM],d[DIM],sol[DIM],tata[DIM];
vector<int> L[DIM];

void dfs(int nod, int niv)
{
    v[nod] = 1;
    d[niv] = nod;
    sol[nod] = sol[ d[niv-k[nod]] ] + 1;
    for (int i=0; i<L[nod].size(); i++)
    {
        int vecin = L[nod][i];
        if (!v[vecin])
            dfs(vecin, niv+1);
    }
}

int main()
{
    fin >> n;
    for (i=1; i<=n; i++)
        fin >> k[i];
    for (i=1; i<n; i++)
    {
        fin >> x >> y;
        L[x].push_back(y);
        tata[y] = x;
    }
    for (i=1; i<=n; i++)
        if (tata[i] == 0)
            break;
    dfs(i, 1);
    for (i=1; i<=n; i++)
        fout << sol[i]-1 << " ";
    return 0;
}