#include<cstdio>
#include<vector>
using namespace std;
vector<int>L[100100];
int n,i,j,x[100100],v[100100],a,b,t[100100],y[100100],nr,s[100100];
FILE *f,*g;
void dfs(int nod){
    v[nod]=1;
    y[++nr]=nod;
    if(x[nod]!=0){
        s[nod]=s[y[nr-x[nod]]]+1;
    }
    for(int i=0;i<L[nod].size();i++){
        if(v[L[nod][i]]==0){
            dfs(L[nod][i]);
            nr--;
        }
    }
}
int main(){
    f=fopen("cerere.in","r");
    g=fopen("cerere.out","w");
    fscanf(f,"%d",&n);
    for(i=1;i<=n;i++){
        fscanf(f,"%d",&x[i]);
    }
    for(i=1;i<n;i++){
        fscanf(f,"%d%d",&a,&b);
        L[a].push_back(b);
        t[b]=a;
    }
    for(i=1;i<=n;i++){
        if(t[i]==0){
            dfs(i);
            break;
        }
    }
    for(i=1;i<=n;i++){
        fprintf(g,"%d ",s[i]);
    }
    fclose(f);
    fclose(g);
    return 0;
}