#include <bits/stdc++.h>
using namespace std;
const long long mod = 998244353;
const int maxn = 1e6 + 50;
const long long inf = 0x3f3f3f3f3f3f3f3fLL;
int gcd(int a, int b) {
  while (b) {
    int t = a % b;
    a = b;
    b = t;
  }
  return a;
}
int lcm(int a, int b) { return a * b / gcd(a, b); }
long long a[maxn];
vector<int> ve[maxn];
long long sz[maxn];
long long dp[maxn];
long long d[maxn];
long long num = 0;
void dfs(int id, int pre) {
  sz[id] = a[id];
  for (auto i : ve[id]) {
    if (i == pre) continue;
    d[i] = d[id] + 1;
    dfs(i, id);
    sz[id] += sz[i];
  }
}
long long mx = 0;
void dfs1(int id, int pre) {
  mx = max(mx, dp[id]);
  for (auto i : ve[id]) {
    if (i == pre) continue;
    dp[i] = dp[id] + num - 2LL * sz[i];
    dfs1(i, id);
  }
}
int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(0);
  std::cout.tie(0);
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> a[i], num += a[i];
  for (int i = 1; i < n; i++) {
    int aa, bb;
    cin >> aa >> bb;
    ve[aa].push_back(bb);
    ve[bb].push_back(aa);
  }
  dfs(1, -1);
  dp[1] = 0;
  for (int i = 1; i <= n; i++) dp[1] += (1LL * d[i] * a[i]);
  dfs1(1, -1);
  cout << mx;
  return 0;
}
