#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<tuple>
#include<cassert>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define Per(i,sta,n) for(int i=n-1;i>=sta;i--)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef long double ld;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;
int dx[4]={1,-1,0,0};
int dy[4]={0,0,1,-1};

int n;
ll a[100010],b[100010];
ll dp[100010][2];
vector<int> G[100010];

void dfs(int s,int par){
    vector<LP> v={}; 
    dp[s][0]=a[s];
    for(int t:G[s]){
        if(t==par) continue;
        dfs(t,s);
        dp[s][0]+=max(dp[t][0],dp[t][1]);
        v.push_back(LP(dp[t][1]+b[t],dp[t][0]));
    }
    sort(v.begin(),v.end(),[](LP a,LP b){
        return a.first-a.second>b.first-b.second;
    });
    ll S=0;
    int m=v.size();
    rep(i,m){
        S+=v[i].second;
    }
    dp[s][1]=S;
    Rep(d,1,m+1){
        S+=v[d-1].first-v[d-1].second;
        dp[s][1]=max(dp[s][1],S+b[s]*d);
    }
}

void solve(){
    cin >> n;
    rep(i,n) cin >> a[i];
    rep(i,n) cin >> b[i];
    rep(i,n-1){
        int u,v;cin >> u >> v;u--;v--;
        G[u].push_back(v);
        G[v].push_back(u);
    }
    dfs(0,-1);
    cout << max(dp[0][0],dp[0][1]) << endl;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(50);
    solve();
}