#include <cstdio>
#include <vector>
using namespace std;

int n;
int H[100005], NR[100005], k[100005];
bool f[100005];
vector <int> v[100005];
inline void dfs(int nod, int lev){
    for(auto it : v[nod]){
        if(f[it]) continue ;
        f[it] = 1;
        H[lev] = it;
        if(k[it] != 0)
        NR[it] = NR[H[lev - k[it]]] + 1;
        dfs(it, lev + 1);
    }
}
int main()
{
    freopen("cerere.in", "r", stdin);
    freopen("cerere.out", "w", stdout);
    scanf("%d", &n);
    for(int i = 1; i <= n ; ++i)
        scanf("%d", &k[i]);
    int x, y;
    for(int i = 1; i <= n ; ++i){
        scanf("%d%d", &x, &y);
        v[x].push_back(y);
        v[y].push_back(x);
    }
    f[1] = 1; H[1] = 1;
    dfs(1, 2);
    for(int i = 1; i <= n ; ++i)
        printf("%d ", NR[i]);
    return 0;
}