#include <fstream>
#include <vector>
#include <algorithm>
#define NMAX 100010
using namespace std;
ifstream fin ("cerere.in");
ofstream fout ("cerere.out");

int n;
int nrstramos[NMAX];
int sol[NMAX];
vector <int> L[NMAX];
int tata[NMAX];
int drum[NMAX];
void dfs(int nod, int nivel)
{
    drum[nivel]=nod;
    sol[nod]=sol[drum[nivel-nrstramos[nod]]]+1;
    for(int i=0; i<L[nod].size(); i++)
    {
        int vecin=L[nod][i];
        dfs(L[nod][i], nivel+1);
    }
}
int main()
{
    fin>>n;
    for(int i=1; i<=n; i++)
        fin>>nrstramos[i];
    int x, y;
    for(int i=1; i<=n-1; i++)
    {
        fin>>x>>y;///x este tatal lui y
        L[x].push_back(y);
        tata[y]=x;

    }
    int radacina=0;
    for(int i=1; i<=n; i++)
        if(tata[i]==0)
    {
        radacina=i;
        break;
    }

    dfs(radacina, 1);

    for(int i=1; i<=n; i++)
        fout<<sol[i]-1<<" ";
    return 0;
}