#include <bits/stdc++.h>
using namespace std;
long long INF = 1 << 28;
const double pi = acos(-1.0);
int fx[] = {1, -1, 0, 0};
int fy[] = {0, 0, 1, -1};
int dir[4][2] = {1, 0, -1, 0, 0, -1, 0, 1};
const long double EPS = 1e-7;
long long gcd(long long a, long long b) {
  if (b == 0)
    return a;
  else
    return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
bool cmp(int a, int b) { return a < b; }
int vis[200000];
struct compare {
  bool operator()(const int& l, const int& r) { return vis[l] > vis[r]; }
};
long long inf = 1e18;
int mod = 1e9 + 7;
const int sz = 300005;
int value[sz];
vector<int> G[sz];
long long dp1[sz], sum[sz], dp2[sz];
void dfs1(int node, int p) {
  int x;
  sum[node] = value[node];
  dp1[node] = 0;
  for (int i = 0; i < G[node].size(); i++) {
    x = G[node][i];
    if (x != p) {
      dfs1(x, node);
      sum[node] += sum[x];
      dp1[node] += (sum[x] + dp1[x]);
    }
  }
}
long long ans = 0;
void dfs2(int node, int p, long long updp, long long upsum) {
  dp2[node] = dp1[node] + updp + upsum;
  ans = max(ans, dp2[node]);
  int x;
  for (int i = 0; i < G[node].size(); i++) {
    x = G[node][i];
    if (x != p) {
      dfs2(x, node, upsum + updp + dp1[node] - dp1[x] - sum[x],
           upsum + sum[node] - sum[x]);
    }
  }
}
int main() {
  int n, x, y;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &value[i]);
  }
  for (int i = 1; i < n; i++) {
    scanf("%d %d", &x, &y);
    G[x].push_back(y);
    G[y].push_back(x);
  }
  dfs1(1, 0);
  dfs2(1, 0, 0, 0);
  cout << ans << endl;
  return 0;
}
