#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;

#define scan(x) do{while((x=getchar())<'0'); for(x-='0'; '0'<=(_=getchar()); x=(x<<3)+(x<<1)+_-'0');}while(0)
char _;
#define complete_unique(a) a.erase(unique(a.begin(),a.end()),a.end())
#define all(a) a.begin(),a.end()
#define println printf("\n");
#define readln(x) getline(cin,x);
#define pb push_back
#define endl "\n"
#define INT_INF 0x3f3f3f3f
#define LL_INF 0x3f3f3f3f3f3f3f3f
#define MOD 1000000007
#define MOD2 1494318097
#define SEED 131
#define mp make_pair
#define fastio cin.tie(0); cin.sync_with_stdio(0);

#define MAXN 3005

typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef unordered_map<int,int> umii;
typedef pair<int,int> pii;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef pair<int,pii> triple;
typedef int8_t byte;

mt19937 g1(time(0));

int randint(int a, int b){return uniform_int_distribution<int>(a, b)(g1);}
ll randlong(ll a,ll b){return uniform_int_distribution<long long>(a, b)(g1);}

ll gcd(ll a, ll b){return b == 0 ? a : gcd(b, a % b);}
ll lcm(ll a, ll b){return a*b/gcd(a,b);}
ll fpow(ll  b, ll exp, ll mod){if(exp == 0) return 1;ll t = fpow(b,exp/2,mod);if(exp&1) return t*t%mod*b%mod;return t*t%mod;}
ll divmod(ll i, ll j, ll mod){i%=mod,j%=mod;return i*fpow(j,mod-2,mod)%mod;}

int num_nodes,vals[MAXN];
ll sz[MAXN],dp[MAXN];
ll res=LLONG_MAX;
vector<int> connections[MAXN];
vector<pii> edges;

void init(int node, int prev){
    sz[node] = vals[node];
    for(int check:connections[node]){
        if(check == prev) continue;
        init(check,node);
        sz[node]+=sz[check];
        dp[node]+=dp[check]+sz[check];
    }
}

void solve(int node, int prev, ll &tmp){
    tmp = min(tmp,dp[node]);
    ll odp = dp[node], osz = sz[node];
    for(int check:connections[node]){
        if(check == prev) continue;
        ll odp2 = dp[check], osz2 = sz[check];

        dp[node]-=(dp[check]+sz[check]);
        sz[node]-=sz[check];

        dp[check]+=dp[node]+sz[node];
        sz[check]+=sz[node];

        solve(check,node,tmp);

        dp[check] = odp2, sz[check] = osz2;
        dp[node] = odp, sz[node] = osz;
    }
}

int main(){
    scanf("%d",&num_nodes);
    for(int i=1; i<=num_nodes; i++)
        scanf(" %d",&vals[i]);
    for(int i=1; i<num_nodes; i++){
        int a,b; scanf(" %d %d",&a,&b);
        connections[a].pb(b);
        connections[b].pb(a);
        edges.pb(mp(a,b));
    }
    for(pii check:edges){
        memset(dp,0,sizeof dp);
        int a = check.first, b = check.second;
        ll f = LLONG_MAX/10, s = LLONG_MAX/10;
        init(a,b); solve(a,b,f);
        init(b,a); solve(b,a,s);
        res = min(res,f+s);
    }
    printf("%lld\n",res);
}