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

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

const int N=100001;

vector<int> muchii[N];
int par[N],k[N],dist[N];
bool areTata[N];
int n;

int gasesteVarf(){
    for(int i=1;i<=n;i++){
        if(areTata[i]==false){
            return i;
        }
    }
    return -1;
}

void bfs(int x,int nivel){
    par[nivel]=x;
    if(k[x]!=0){
        dist[x] = 1+ dist[par[nivel-k[x]]];
    }
    for(int i=0;i<muchii[x].size();i++){
        bfs(muchii[x][i],nivel+1);
    }
}

int main()
{
    in>>n;
    for(int i=1;i<=n;i++){
        in>>k[i];
    }
    for(int i=1;i<n;i++){
        int x,y;
        in>>x>>y;
        areTata[y]=true;
        muchii[x].push_back(y);
    }
    bfs(gasesteVarf(),1);
    for(int i=1;i<=n;i++){
        out<<dist[i]<<" ";
    }
    return 0;
}