#include<bits/stdc++.h>
#define ll long long
#define int long long
using namespace std;

const int maxn = 210000;

vector<int>E[maxn];
int n,m;
int a[maxn];
int fa[maxn],siz[maxn],sum[maxn];
int f[maxn],g[maxn];
struct node
{
    int a,b,i;
    friend inline bool operator <(const node &k1,const node &k2){ return k1.a*k2.b < k1.b*k2.a; }
};
void dfs(const int x)
{
    siz[x]=1;
    sum[x]=a[x];
    for(auto y:E[x]) if(y!=fa[x])
    {
        fa[y]=x;
        dfs(y);
        siz[x]+=siz[y];
        sum[x]+=sum[y];
    }

    f[x]=a[x];
    vector<node>V;
    for(auto y:E[x]) if(y!=fa[x])
    {
        V.push_back( (node){ siz[y],sum[y],y } );
        f[x]+=f[y];
    }
    sort(V.begin(),V.end());
    int num=1;
    for(auto k:V)
    {
        f[x]+=num*k.b;
        num+=k.a;
    }
}
ll ans;
void calc(const int x)
{
    vector<node>V;
    for(auto y:E[x])
    {
        if(y!=fa[x]) V.push_back( (node){ siz[y],sum[y],y } );
        else V.push_back( (node){ n-siz[x],m-sum[x],y } );
    }
    sort(V.begin(),V.end());

    int vn=(int)V.size();
    vector<int>rb(vn+1),la(vn+1);
    la[0]=1;
    for(int i=1;i<vn;i++) la[i]=la[i-1]+V[i-1].a;
    for(int i=vn-1;i>0;i--) rb[i-1]=rb[i]+V[i].b;
    
    ll temp=a[x],num=1;
    for(int i=0;i<vn;i++) 
    {
        temp+= num*V[i].b;
        num += V[i].a;

        int y=V[i].i;
        if( y!=fa[x] ) temp+= f[y];
        else temp+=g[x];
    }
    ans=min(ans,temp);

    for(int i=0;i<vn;i++) if(V[i].i!=fa[x])
    {
        int y=V[i].i;
        g[y]= temp-f[y]- V[i].a*rb[i] -V[i].b*la[i];
    }
    for(auto y:E[x]) if(y!=fa[x])
        calc(y);
}

signed main()
{
    ios_base::sync_with_stdio(false);

    cin>>n;
    for(int i=1;i<n;i++)
    {
        int x,y; cin>>x>>y;
        E[x].push_back(y);
        E[y].push_back(x);
    }
    for(int i=1;i<=n;i++) 
    {
        cin>>a[i];
        m+=a[i];
    }
    dfs(1);
    ans=LLONG_MAX;
    calc(1);
    cout<<ans<<endl;

    return 0;
}