#include <cstdio>
#include <iostream>
#include <cstring>
using namespace std;
const int maxn=50010;
typedef long long ll;
int n,cnt;
int head[maxn],to[maxn<<1],next[maxn<<1],fa[maxn],ins[maxn];
ll siz[maxn],f[maxn][2],g[maxn];
ll tot,now,ans,sz;
inline void add(int a,int b)
{
	to[cnt]=b,next[cnt]=head[a],head[a]=cnt++;
}
inline ll rd()
{
	ll ret=0,f=1;	char gc=getchar();
	while(gc<‘0‘||gc>‘9‘)	{if(gc==‘-‘)f=-f;	gc=getchar();}
	while(gc>=‘0‘&&gc<=‘9‘)	ret=ret*10+gc-‘0‘,gc=getchar();
	return ret*f;
}
void dfs1(int x)
{
	for(int i=head[x];i!=-1;i=next[i])	if(to[i]!=fa[x])
	{
		fa[to[i]]=x,dfs1(to[i]),siz[x]+=siz[to[i]],g[x]+=g[to[i]]+siz[to[i]];
		if(siz[to[i]]>siz[f[x][0]])	f[x][1]=f[x][0],f[x][0]=to[i];
		else	f[x][1]=(siz[f[x][1]]>siz[to[i]])?f[x][1]:to[i];
	}
}
inline ll calc(int x,int y)
{
	ll sy=siz[y]-(ins[y])*sz;
	return now-2*sy+tot;
}
void dfs3(int x)
{
	ll t1=calc(x,f[x][0]),t2=calc(x,f[x][1]);
	if(t1<t2)
	{
		if(t1<now)	now=t1,dfs3(f[x][0]);
	}
	else	if(t2<now)	now=t2,dfs3(f[x][1]);
}
void dfs2(int x,int dep)
{
	ins[x]=1;
	if(x!=1)
	{
		ll tmp=0;
		tot=siz[x],sz=0,now=g[x],dfs3(x),tmp+=now;
		tot=siz[1]-siz[x],sz=siz[x],now=g[1]-g[x]-dep*siz[x],dfs3(1),tmp+=now;
		ans=min(ans,tmp);
	}
	for(int i=head[x];i!=-1;i=next[i])	if(to[i]!=fa[x])	dfs2(to[i],dep+1);
	ins[x]=0;
}
int main()
{
	n=rd();
	int i,a,b;
	memset(head,-1,sizeof(head));
	for(i=1;i<n;i++)	a=rd(),b=rd(),add(a,b),add(b,a);
	for(i=1;i<=n;i++)	siz[i]=rd();
	dfs1(1),ans=g[1],dfs2(1,0);
	printf("%lld",ans);
	return 0;
}