#include <bits/stdc++.h>
#pragma GCC optimize(2)
using namespace std;
inline int read() {
  char c = getchar();
  int x = 0, f = 1;
  while (c < '0' || c > '9') {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') x = (x << 3) + (x << 1) + c - '0', c = getchar();
  return x * f;
}
inline long long readll() {
  char c = getchar();
  long long x = 0, f = 1;
  while (c < '0' || c > '9') {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') x = (x << 3) + (x << 1) + c - '0', c = getchar();
  return x * f;
}
template <typename T>
void write(T x) {
  if (x < 0) putchar('-'), x = -x;
  if (x >= 10) write(x / 10);
  putchar('0' + x % 10);
}
const double PI = acos((double)-1.0);
const double EPS = 1e-6;
inline int fcmp(double a, double b) {
  return (fabs(a - b) < EPS) ? 0 : (a < b ? -1 : 1);
}
const int INFINT = 0x3f3f3f3f;
const long long INFLL = 0x3f3f3f3f3f3f3f3f;
const long long MOD1 = (long long)(1e9 + 7), MOD2 = 998244353;
const int maxn = 200100;
int n;
long long subw[maxn];
long long szw[maxn];
long long ans[maxn];
long long val[maxn];
vector<int> edge[maxn];
void init() {
  for (int i = 0; i <= n; ++i) {
    edge[i].clear();
    val[i] = 0;
  }
}
void dfs1(int u, int pre) {
  szw[u] = val[u];
  subw[u] = 0ll;
  for (auto &v : edge[u]) {
    if (v == pre) continue;
    dfs1(v, u);
    szw[u] += szw[v];
    subw[u] += subw[v] + szw[v];
  }
}
void dfs2(int u, int pre) {
  for (auto &v : edge[u]) {
    if (v == pre) continue;
    ans[v] = ans[u] + (szw[1] - szw[v]) - szw[v];
    dfs2(v, u);
  }
}
int main() {
  scanf("%d", &n);
  init();
  for (int i = 1; i <= n; ++i) scanf("%lld", val + i);
  for (int i = 2, u, v; i <= n; ++i) {
    scanf("%d%d", &u, &v);
    edge[u].push_back(v);
    edge[v].push_back(u);
  }
  dfs1(1, 0);
  ans[1] = subw[1];
  dfs2(1, 0);
  long long mx = 0;
  for (int i = 1; i <= n; ++i) mx = max(mx, ans[i]);
  printf("%lld\n", mx);
}
