#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target( \
    "sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
using namespace std;
void itval(istream_iterator<string> it) {}
template <typename T, typename... Args>
void itval(istream_iterator<string> it, T a, Args... args) {
  cerr << *it << " = " << a << endl;
  itval(++it, args...);
}
const long long int MOD = 1e9 + 7;
template <typename T>
inline void print(T x) {
  cout << x << "\n";
}
template <typename T>
inline void printvec(T x) {
  for (auto a : x) cout << a << ' ';
  cout << '\n';
}
struct custom {
  bool operator()(const pair<long long int, long long int> &p1,
                  const pair<long long int, long long int> &p2) const {
    if (p1.first == p2.first) return p1.second > p2.second;
    return p1.first < p2.first;
  }
};
long long int get_pow(long long int a, long long int b, long long int M = MOD) {
  long long int res = 1;
  while (b) {
    if (b & 1) res = (res * a) % M;
    a = (a * a) % M;
    b >>= 1;
  }
  return res;
}
const long long int N = 2e5 + 7, inf = 2e18;
std::vector<vector<int> > adj(N);
long long int a[N], tot[N], res, ans;
void dfs(int s, int p, long long int h) {
  res += h * a[s];
  tot[s] += a[s];
  for (auto x : adj[s]) {
    if (x != p) {
      dfs(x, s, h + 1);
      tot[s] += tot[x];
    }
  }
}
void CALC(int s, int p) {
  ans = max(ans, res);
  for (auto x : adj[s]) {
    if (x != p) {
      res -= tot[x];
      tot[s] -= tot[x];
      res += tot[s];
      tot[x] += tot[s];
      CALC(x, s);
      res -= tot[s];
      tot[x] -= tot[s];
      res += tot[x];
      tot[s] += tot[x];
    }
  }
}
void solve() {
  int n;
  cin >> n;
  for (long long int i = (long long int)0; i < (long long int)(n); i++) {
    cin >> a[i];
  }
  int x, y;
  for (long long int i = (long long int)0; i < (long long int)(n - 1); i++) {
    cin >> x >> y;
    x--;
    y--;
    adj[x].push_back(y);
    adj[y].push_back(x);
  }
  dfs(0, -1, 0);
  CALC(0, -1);
  cout << ans;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int test = 1;
  clock_t z = clock();
  for (long long int tes = (long long int)0; tes < (long long int)(test);
       tes++) {
    solve();
  }
  fprintf(stderr, "Total Time:%.4f\n", (double)(clock() - z) / CLOCKS_PER_SEC),
      fflush(stderr);
  return 0;
}
