#include <bits/stdc++.h>
using namespace std;
long long n, x, y;
long long a[200010], d[200010], ch[200010];
vector<long long> v[200010], c;
long long ic[200010];
long long b[200010] = {};
long long tmp = 0, ans = 0;
long long s = 0;
void upd(long long x, long long v) {
  while (x <= 200005) {
    b[x] += v;
    x += (x & -x);
  }
}
long long get(long long x) {
  if (!x) return 0;
  long long r = 0;
  while (x) {
    r += b[x];
    x -= (x & -x);
  }
  return r;
}
long long dfs(long long x, long long p, long long dp) {
  tmp += dp * a[x];
  d[x] = dp;
  c.push_back(x);
  ic[x] = c.size();
  ch[x] = 1;
  for (auto e : v[x]) {
    if (e == p) continue;
    ch[x] += dfs(e, x, dp + 1);
  }
  return ch[x];
}
void dfs2(long long x, long long p, long long t) {
  ans = max(ans, t);
  for (auto e : v[x]) {
    if (e == p) continue;
    tmp = get(ic[e] + ch[e] - 1) - get(ic[e] - 1);
    dfs2(e, x, t - tmp + s - tmp);
  }
}
int main() {
  scanf("%lld", &n);
  for (long long i = 1; i <= n; ++i) {
    scanf("%lld", a + i);
    s += a[i];
  }
  for (long long i = 1; i < n; ++i) {
    scanf("%lld %lld", &x, &y);
    v[x].push_back(y);
    v[y].push_back(x);
  }
  dfs(1, 0, 0);
  for (long long i = 0; i < n; ++i) {
    upd(i + 1, a[c[i]]);
  }
  dfs2(1, 0, tmp);
  printf("%lld\n", ans);
  return 0;
}
