#include <bits/stdc++.h>
using namespace std;
ifstream fin("cerere.in");
ofstream fout("cerere.out");
int n,i,x,y,T[100010],K[100010],sol[100010],f[100010];
vector<int> L[100010];
void cautare(int nod){
    int crt=nod;
    for(;K[nod]--;)
        crt=T[crt];
    sol[nod]=sol[crt]+1;
}
void dfs(int nod){
    f[nod]=1;
    for(int i=0;i<L[nod].size();i++){
        int vec=L[nod][i];
        if(!f[vec]){
            if(K[vec])
                cautare(vec);
            dfs(vec);
        }
    }
}
int main(){
    fin>>n;
    for(i=1;i<=n;i++)
        fin>>K[i];
    for(i=1;i<n;i++){
        fin>>x>>y;
        L[x].push_back(y);
        L[y].push_back(x);
        T[y]=x;
    }
    for(i=1;i<=n;i++)
        if(!T[i]&&!K[i])
            break;
    dfs(i);
    for(i=1;i<=n;i++)
        fout<<sol[i]<<" ";

    return 0;
}