#include <bits/stdc++.h>
#define L 100005
using namespace std;
ifstream fin("cerere.in");
ofstream fout("cerere.out");

int up[L], lev[L], v[L], ans[L], res[L], n, root, j;
bool vis[L];
vector <int> G[L], LEV[L];

inline void clear_vis(){
  int i;
  for (i = 0; i <= n; i++)
    vis[i] = false;
  lev[root] = 1;
  LEV[1].push_back(root);
}

inline void DFS(int node){
  vis[node] = true;
  v[j] = node;
  ans[node] = v[j - up[node]];
  j++;
  for (auto it : G[node])
    if (!vis[it]){
      lev[it] = lev[node] + 1;
      LEV[lev[it]].push_back(it);
      DFS(it);
    }
  j--;
}

int main(){
  int i, x, y;
  fin >> n;
  for (i = 1; i <= n; i++)
    fin >> up[i];
  for (i = 1; i < n; i++){
    fin >> x >> y;
    G[x].push_back(y);
    vis[y] = true;
  }
  i = 1;
  while (vis[i++]);
  root = i - 1;
  clear_vis();
  DFS(root);
  for (i = 1; i <= n; i++)
    for (auto it : LEV[i])
      if (ans[it] == it)
        res[it] = 0;
      else
        res[it] = 1 + res[ans[it]];
  for (i = 1; i <= n; i++)
    fout << res[i] << " ";
  fout << "\n";
  return 0;
}