#include <bits/stdc++.h>
using namespace ::std;
const long double PI = acos(-1);
const long long MOD = 1000000000 + 7;
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
long long add(long long a, long long b, long long m = MOD) {
  if (a >= m) a %= m;
  if (b >= m) b %= m;
  if (a < 0) a += m;
  if (b < 0) b += m;
  long long res = a + b;
  if (res >= m or res <= -m) res %= m;
  if (res < 0) res += m;
  return res;
}
long long mul(long long a, long long b, long long m = MOD) {
  if (a >= m) a %= m;
  if (b >= m) b %= m;
  if (a < 0) a += m;
  if (b < 0) b += m;
  long long res = a * b;
  if (res >= m or res <= -m) res %= m;
  if (res < 0) res += m;
  return res;
}
long long pow_mod(long long a, long long b, long long m = MOD) {
  long long res = 1LL;
  a = a % m;
  while (b) {
    if (b & 1) res = mul(res, a, m);
    b >>= 1;
    a = mul(a, a, m);
  }
  return res;
}
long long fastexp(long long a, long long b) {
  long long res = 1LL;
  while (b) {
    if (b & 1) res = res * a;
    b >>= 1;
    a *= a;
  }
  return res;
}
int gcdExtendido(int a, int b, int *x, int *y) {
  if (a == 0) {
    *x = 0;
    *y = 1;
    return b;
  }
  int x1, y1;
  int gcd = gcdExtendido(b % a, a, &x1, &y1);
  *x = y1 - (b / a) * x1;
  *y = x1;
  return gcd;
}
int modInverso(int a, int m) {
  int x, y;
  int g = gcdExtendido(a, m, &x, &y);
  if (g != 1)
    return -1;
  else
    return (x % m + m) % m;
}
const int N = 200000 + 5;
int n;
vector<int> G[N];
int a[N];
int in[N];
int out[N];
int memo[N];
void DFS(int u, int id, int p = -1) {
  if (id == 0) {
    in[u] = a[u];
    for (int v : G[u]) {
      if (v == p) continue;
      DFS(v, id, u);
      in[u] += max(0, in[v]);
    }
  } else {
    int bestsum = a[u];
    for (int v : G[u]) {
      if (v == p) continue;
      bestsum += max(0, in[v]);
    }
    for (int v : G[u]) {
      if (v == p) continue;
      int bestadd = bestsum + out[u] - a[u];
      if (in[v] >= 0) bestadd -= in[v];
      bestadd = max(bestadd, 0);
      out[v] = bestadd + a[v];
    }
    for (int v : G[u]) {
      if (v == p) continue;
      DFS(v, id, u);
    }
  }
}
void preprocess() {
  for (int i = 1; i <= n; i++) {
    memo[i] = in[i] + out[i] - a[i];
  }
}
int main() {
  scanf("%d", &(n));
  for (int i = 1; i <= n; i++) {
    scanf("%d", &(a[i]));
    if (a[i] == 0) a[i] = -1;
  }
  for (int i = 1; i < n; i++) {
    int u, v;
    scanf("%d %d", &(u), &(v));
    G[u].emplace_back(v);
    G[v].emplace_back(u);
  }
  DFS(1, 0);
  out[1] = a[1];
  DFS(1, 1);
  preprocess();
  for (int i = 1; i <= n; i++) {
    printf("%d%c", memo[i], " \n"[i == n]);
  }
  return 0;
}
