#include <stdio.h>

#define MAX_N 100000
#define NIL -1

typedef struct {
  int v, next;
} cell;

cell l[MAX_N - 1];
int adj[MAX_N];

int ask[MAX_N];
int answer[MAX_N];

char notRoot[MAX_N];

int st[MAX_N];
int ss;

void addEdge(int u, int v, int pos) {
  l[pos].v = v;
  l[pos].next = adj[u];
  adj[u] = pos;
}

void DFS(int u, int pr) {
  int i;
  st[ss++] = u;
  if (ask[u]) {
    answer[u] = answer[st[ss - 1 - ask[u]]] + 1;
  }
  for (i = adj[u]; i != NIL; i = l[i].next) {
    if (l[i].v != pr) {
      DFS(l[i].v, u);
    }
  }
  ss--;
}

int main(void) {
  FILE *f = fopen("cerere.in", "r");
  int n, i, u, v;

  fscanf(f, "%d", &n);
  for (i = 0; i < n; i++) {
    adj[i] = NIL;
    fscanf(f, "%d", &ask[i]);
  }
  for (i = 1; i < n; i++) {
    fscanf(f, "%d%d", &u, &v);
    notRoot[v - 1] = 1;
    addEdge(u - 1, v - 1, i - 1);
  }
  fclose(f);

  i = 0;
  while (i < n && notRoot[i]) {
    i++;
  }
  DFS(i, NIL);

  f = fopen("cerere.out", "w");
  for (i = 0; i < n; i++) {
    fprintf(f, "%d ", answer[i]);
  }
  fclose(f);
  return 0;
}