#include<cstdio>
#include<vector>
#define MAXN 100010
using namespace std;
vector<int> g[MAXN];
int ancestor[MAXN],answer[MAXN],Stack[MAXN],top=0;
void DFS(int node){
    int i;
    if(ancestor[node]==0)
        answer[node]=0;
    else
        answer[node]=1+answer[Stack[top-ancestor[node]+1]];
    top++;
    Stack[top]=node;
    for(i=0;i<g[node].size();i++)
        if(g[node][i]!=Stack[top-1])
            DFS(g[node][i]);
    top--;
}
int main(){
    freopen("cerere.in","r",stdin);
    freopen("cerere.out","w",stdout);
    int n,i,a,b;
    scanf("%d",&n);
    for(i=1;i<=n;i++)
        scanf("%d",&ancestor[i]);
    for(i=1;i<n;i++){
        scanf("%d%d",&a,&b);
        g[a].push_back(b);
        g[b].push_back(a);
    }
    DFS(1);
    for(i=1;i<=n;i++)
        printf("%d ",answer[i]);
    return 0;
}