#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef basic_string<int> BI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(random_device{}()); 
const ll mod=1000000007;
int rnd(int x) { return mrand() % x;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head

const int N=201000;
ll sz[N],sm[N],sw,ans;
ll w1,w2,w3;
vector<array<ll,3>> ch[N];
VI e[N];
int n,w[N];
map<int,ll> pcal[N];
void dfs(int u,int f) {
	sz[u]=1;
	sm[u]=w[u];
	for (auto v:e[u]) if (v!=f) {
		dfs(v,u);
		sz[u]+=sz[v];
		sm[u]+=sm[v];
		ch[u].pb({sm[v],sz[v],v});
	}
	if (f!=0) ch[u].pb({sw-sm[u],n-sz[u],f});
	sort(all(ch[u]),[&](array<ll,3> &a,array<ll,3> &b) {
		return a[0]*b[1]<a[1]*b[0];
	});
	w1+=sm[u];
	ll psm=0,qsz=n-1;
	for (auto [sm,sz,id]:ch[u]) {
		w2+=psm*sz;
		qsz-=sz;
		pcal[u][id]=psm*sz+sm*qsz;
		psm+=sm;
		//printf("? %d %lld %lld\n",u,id,pcal[u][id]);
	}
	assert(qsz==0);
	//w2+=pw;
	if (f!=0) w3+=pcal[u][f];
}
void dfs2(int u,int f,ll w1,ll w3) {
	//printf("%d %d %lld %lld %lld\n",u,f,w1,w2,w3);
	ans=min(ans,w1+w2-w3);
	for (auto v:e[u]) if (v!=f) {
		ll nw1=w1-sm[v]+(sw-sm[v]);
		ll nw3=w3-pcal[v][u]+pcal[u][v];
		dfs2(v,u,nw1,nw3);
	}
}
int main() {
	scanf("%d",&n);
	rep(i,1,n) {
		int u,v;
		scanf("%d%d",&u,&v);
		e[u].pb(v);
		e[v].pb(u);
	}
	rep(i,1,n+1) scanf("%d",&w[i]),sw+=w[i];
	dfs(1,0);
	ans=1ll<<60;
	dfs2(1,0,w1,w3);
	printf("%lld\n",ans);
}