#include <cstdio>
#include <vector>

using namespace std;

const int N = (int) 1e5 + 7;
int n, jump[N];
vector <int> g[N];
vector <int> path;
int dp[N];
bool root[N];

void dfs(int v) {
  path.push_back(v);
  dp[v] = 1 + dp[path[(int) path.size() - 1 - jump[v]]];
  for (auto &u : g[v]) {
    dfs(u);
  }
  path.pop_back();
}

int main() {
  freopen ("cerere.in", "r", stdin);
  freopen ("cerere.out", "w", stdout);

  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &jump[i]);
  }

  for (int i = 1; i <= n; i++) {
    root[i] = 1;
  }

  for (int i = 1; i < n; i++) {
    int a, b;
    scanf("%d %d", &a, &b);
    root[b] = 0;   g[a].push_back(b);
  }

  for (int i = 1; i <= n; i++) {
    if (root[i]) {
      dfs(i);
    }
  }

  for (int i = 1; i <= n; i++) {
    printf("%d ", dp[i] - 1);
  }
  printf("\n");

  return 0;
}