#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pii pair<int,int>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define endl '\n'
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,x) distance(c.begin(),lower_bound(all(c),x))
#define ub(c,x) distance(c.begin(),upper_bound(all(c),x))

using namespace std;

const ll mod=1e9+7;


int main(){
    ll n;
    cin >> n;
    vector<ll> a(n),b(n);
    rep(i,n){
        cin >> a[i];
    }
    rep(i,n){
        cin >> b[i];
    }
    set<pll> s;
    map<ll,ll> m;
    vector<ll> del(n);
    vector<vector<ll>> to(n);
    rep(i,n-1){
        ll u,v;
        cin >> u >> v;
        u--; v--;
        to[u].push_back(v);
        to[v].push_back(u);
    }
    ll sum=0;
    rep(i,n){
        ll dec=0;
        for(auto x:to[i]){
            dec+=b[x];
        }
        s.insert({-a[i]+b[i]*to[i].size()+dec,i});
        m[i]=-a[i]+b[i]*to[i].size()+dec;
    }
    ll tot=0;
    while(s.size()){
        pll val=*s.begin();
        if(val.fi>=0){
            s.erase(val);
            continue;
        }
        for(auto x:to[val.se]){
            if(del[x]) continue;
            s.erase({m[x],x});
            m[x]-=b[x];
            s.insert({m[x],x});
        }
        s.erase(val);
        del[val.se]=1;
    }
    rep(i,n){
        //cout << del[i] << endl;
    }
    rep(i,n){
        if(del[i]){
            tot+=a[i];
            continue;
        }
        ll cnt=0;
        for(auto x:to[i]){
            if(del[x]==0) cnt++;
        }
        tot+=cnt*b[i];
    }
    cout << tot << endl;
    return 0;
}