#include <fstream>
#include <vector>

using namespace std;

ifstream cin ("cerere.in");
ofstream cout ("cerere.out");

int n, x, y, root;

int dp[100005], k[100005];
int curr[100005];
bool hasFather[100005];
vector <int> g[100005];

void dfs(int nod, int niv) {
  curr[niv] = nod;
  if(k[nod])
    dp[nod] = dp[curr[niv - k[nod]]] + 1;
  else
    dp[nod] = 0;
  for(auto &son : g[nod])
    dfs(son, niv + 1);
}

int main() {
  cin >> n;
  for(int i = 1; i <= n; i++)
    cin >> k[i];
  for(int i = 1; i < n; i++) {
    cin >> x >> y;
    hasFather[y] = 1;
    g[x].push_back(y);
  }
  for(int i = 1; i <= n; i++) {
    if(!hasFather[i]) {
      root = i;
      break;
    }
  }
  dfs(root, 1);
  for(int i = 1; i <= n; i++)
    cout << dp[i] << " ";
  return 0;
}