#include <bits/stdc++.h>
using namespace std;
inline void fast() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}
const long long int mod = (long long int)(1e9) + 7;
long long int pmod(long long int x, long long int n) {
  long long int r = 1;
  while (n > 0) {
    if (n & 1LL) r = (r * x) % mod;
    x = (x * x) % mod;
    n = n / 2;
  }
  return r % mod;
}
long long int n;
const int mxn = (int)(2e5);
vector<int> adj[mxn + 1];
long long int a[mxn + 1];
long long int dp1[mxn + 1], dp2[mxn + 1], dp3[mxn + 1];
long long int sb[mxn + 1];
void dfs(int u, int p) {
  sb[u] = a[u];
  for (auto it : adj[u]) {
    if (it == p) continue;
    dfs(it, u);
    sb[u] += sb[it];
    dp1[u] += (dp1[it] + sb[it]);
  }
}
void dfs1(int u, int p) {
  dp3[u] = dp1[u] + dp2[u];
  for (auto it : adj[u]) {
    if (it == p) continue;
    dp2[it] = dp2[u] + (dp1[u] - dp1[it] - sb[it]) + (sb[1] - sb[it]);
    dfs1(it, u);
  }
}
void solve() {
  cin >> n;
  int x, y;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  for (int i = 1; i < n; i++) {
    cin >> x >> y;
    adj[x].push_back(y);
    adj[y].push_back(x);
  }
  dfs(1, 0);
  dfs1(1, 0);
  long long int mx = 0;
  for (int i = 1; i <= n; i++) {
    mx = max(mx, dp3[i]);
  }
  cout << mx;
}
int main() {
  fast();
  solve();
}
