#ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif
#include<bits/stdc++.h>
using namespace std;
#define rep(i,s,t) for(ll i = (ll)(s); i < (ll)(t); i++)
#define rrep(i,s,t) for(ll i = (ll)(s-1);(ll)(t) <= i; i--)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> Pll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
constexpr ll INF = numeric_limits<ll>::max()/4;
constexpr ll n_max = 2e5+10;
#define int ll

template <typename A, typename B>
string to_string(pair<A, B> p);
string to_string(const string &s) {return '"' + s + '"';}
string to_string(const char *c) {return to_string((string) c);}
string to_string(bool b) {return (b ? "true" : "false");}
template <size_t N>
string to_string(bitset<N> v){
    string res = "";
    for(size_t i = 0; i < N; i++) res += static_cast<char>('0' + v[i]);
    return res;
}
template <typename A>
string to_string(A v) {
    bool first = true;
    string res = "{";
    for(const auto &x : v) {
        if(!first) res += ", ";
        first = false;
        res += to_string(x);
    }
    res += "}";
    return res;
}
template <typename A, typename B>
string to_string(pair<A, B> p){return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";}

void debug_out() {cerr << endl;}
template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << " " << to_string(H);
    debug_out(T...);
}

#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

template<class T>
bool chmax(T &a, T b){if(a < b){a = b; return true;} return false;}
template<class T>
bool chmin(T &a, T b){if(a > b){a = b; return true;} return false;}

signed main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    ll n; cin >> n;
    vector<ll> a(n);
    for(int i = 0; i < n; i++) cin >> a[i];
    vector<ll> b(n);
    for(int i = 0; i < n; i++) cin >> b[i];

    vector<ll> in(n), bs(n);
    vector<vector<ll>> graph(n);
    for(int i = 0; i < n-1; i++) {
        ll u,v;cin >> u >> v;
        u--;v--;
        graph[u].emplace_back(v);
        graph[v].emplace_back(u);
        in[u]++;in[v]++;
        bs[u] += b[v];
        bs[v] += b[u];
    }
    

    ll ans = 0;
    rep(i,0,n){
        ans += in[i] * b[i];
    }
    debug(ans);
    vector<ll> used(n, 1);
    auto dfs = [&](auto self, ll now, ll pre = -1) -> void{
        ll t = a[now] - bs[now] - b[now] * in[now];
        if(pre != -1 && used[pre] == 0){
            t += b[pre] + b[now];
        }
        debug(now, t);
        if(t > 0){
            used[now] = 0;
            ans += t;
        }
        for(auto &to : graph[now]){
            if(to == pre)continue;
            self(self, to, now);
        }
    };

    dfs(dfs, 0);

    cout << ans << endl;
}