#include <bits/stdc++.h>
using namespace std; 
#define ll long long
#define fi first
#define se second
#define int long long
typedef pair<int,int> pii;
const int MAXN = 2e5 +5;

int  ans2 =0,  total =0;
vector <int> adj[MAXN];
vector <int> a(MAXN), sum(MAXN), ans(MAXN);
//bool vis[MAXN];

void dfs(int x, int p, int h){
    ans[1] += h*a[x];
    sum[x] = a[x];
    
    for (auto i : adj[x]){
        if (i != p) {
        dfs(i, x, h+1);
        sum[x] += sum[i];
}
    }
}

void dfs2(int x, int p){
   if ( x != 1){
       ans[x] = ans[p] - sum[x] + total- sum[x]; 
   }
   
   ans2 = max(ans2, ans[x]);
   
   for (auto i : adj[x]){
       if(i != p) {
       dfs2(i, x);
   }
}
}
signed main(){
ios_base::sync_with_stdio(0); cin.tie(0);
int n;
    cin >> n;


    for (int i =1; i <= n; i++){
        cin >> a[i];
        total += a[i];
    }
    for (int i =1; i <= n-1; i++){
        int x, y;
        cin >> x >> y;
        adj[x].push_back(y);
        adj[y].push_back(x);
    }
    

    dfs(1, 0, 0);
    dfs2(1, 0);
    cout << ans2;
}