#include <bits/stdc++.h>
using namespace std;
vector<long long> dp1(2e5 + 1, 0), dp2(2e5 + 1, 0);
vector<long long> v[200001];
long long n;
vector<long long> a(2e5 + 1);
vector<long long> vis(2e5 + 1, 0);
void dfs(long long c) {
  vis[c] = 1;
  for (auto j : v[c]) {
    if (!vis[j]) {
      dfs(j);
      dp1[c] += max(0LL, dp1[j]);
    }
  }
  dp1[c] += a[c];
}
void dfs2(long long c) {
  vis[c] = 1;
  dp2[c] += dp1[c];
  for (auto j : v[c]) {
    if (!vis[j]) {
      long long k = max(dp2[c], 0LL) - max(dp1[j], 0LL);
      dp2[j] += max(0LL, k);
      dfs2(j);
    }
  }
}
signed main(void) {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  for (__typeof(n + 1) i = (1) - ((1) > (n + 1));
       i != (n + 1) - ((1) > (n + 1)); i += 1 - 2 * ((1) > (n + 1))) {
    long long k;
    cin >> k;
    if (k == 0)
      a[i] = -1;
    else
      a[i] = 1;
  }
  for (__typeof(n - 1) i = (0) - ((0) > (n - 1));
       i != (n - 1) - ((0) > (n - 1)); i += 1 - 2 * ((0) > (n - 1))) {
    long long x, y;
    cin >> x >> y;
    v[x].push_back(y);
    v[y].push_back(x);
  }
  dfs(1);
  for (__typeof(2e5 + 1) i = (1) - ((1) > (2e5 + 1));
       i != (2e5 + 1) - ((1) > (2e5 + 1)); i += 1 - 2 * ((1) > (2e5 + 1)))
    vis[i] = 0;
  dfs2(1);
  for (__typeof(n + 1) i = (1) - ((1) > (n + 1));
       i != (n + 1) - ((1) > (n + 1)); i += 1 - 2 * ((1) > (n + 1)))
    cout << dp2[i] << ' ';
  cout << '\n';
}
