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

using namespace std;

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


int n;

const int N=100001;

int v[N], d[N], cost[N] , viz[N] , tata[N];

vector <int> a[N];



void citire()

{


    for(int i=1; i<=n; i++) in>>v[i];

    for(int i=1; i<=n-1; i++)

    {

        int x, y;

        in>>x>>y;

        a[x].push_back(y);
        tata[y]=x;

    }

}

void dfs(int x , int niv)
{
    d[niv]=x;
    cost[x]=1+cost[d[niv-v[x]]];
     for(int i=0; i<a[x].size(); ++i)
     {
        int y=a[x][i];
        dfs(y,niv+1);
     }
}

int main()
{
    int i,x,y;
    in>>n;
    citire();
    int vf=1;
    for(int i=1; i<=n; ++i) if(tata[i]==0) vf=i;
    dfs(vf,1);
    for(i=1 ; i<=n ; i++)
    {
        out<<cost[i]-1<<" ";
    }
    return 0;
}