#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
const int MAX = 2e5 + 10;
vector<int> e[MAX];
int c[MAX];
int v[MAX];
int F[MAX];
int D[MAX];
int R[MAX];
void dfs1(int x) {
  v[x] = 1;
  for (int y : e[x]) {
    if (v[y] == 0) {
      F[y] = x;
      dfs1(y);
    }
  }
}
void dfs2(int x) {
  if (c[x] == 1)
    D[x] = 1;
  else
    D[x] = -1;
  for (int y : e[x]) {
    if (y == F[x]) continue;
    dfs2(y);
    D[x] += max(0, D[y]);
  }
}
void dfs3(int x) {
  if (x == 1)
    R[x] = D[x];
  else {
    int q1 = D[x];
    int q2 = R[F[x]] + min(0, D[x]);
    R[x] = max(q1, q2);
  }
  for (int y : e[x]) {
    if (y == F[x]) continue;
    dfs3(y);
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> c[i];
  }
  for (int i = 1; i <= n - 1; i++) {
    int a, b;
    cin >> a >> b;
    e[a].push_back(b);
    e[b].push_back(a);
  }
  F[1] = 1;
  dfs1(1);
  dfs2(1);
  dfs3(1);
  for (int i = 1; i <= n; i++) {
    cout << R[i];
    if (i < n)
      cout << " ";
    else
      cout << "\n";
  }
}
