#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <iomanip>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <cstdint>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pii;
#define MP make_pair
#define PB push_back
#define inf 1000000007
#define rep(i,n) for(int i = 0; i < (int)(n); ++i)
#define all(x) (x).begin(),(x).end()

template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
    std::fill( (T*)array, (T*)(array+N), val );
}
 
template<class T> inline bool chmax(T &a, T b){
    if(a<b){
        a = b;
        return true;
    }
    return false;
}

template<class T> inline bool chmin(T &a, T b){
    if(a>b){
        a = b;
        return true;
    }
    return false;
}
vector<ll>a,b;
vector<vector<int> > g;
ll res[100010][2];
void dfs(int id,int pre){
    for(auto x:g[id]){
        if(x==pre)continue;
        dfs(x,id);
    }
    priority_queue<ll> pq;
    ll sm = 0;
    ll base = 0;
    for(auto x:g[id]){
        if(x==pre)continue;
        base += res[x][0];
        sm += max(res[x][0],res[x][1]);
        pq.push(res[x][1] - res[x][0] + b[x]);
    }
    sm += a[id];
    res[id][0] = sm;
    ll c = 0;
    res[id][1] = base;
    while(!pq.empty()){
        auto x = pq.top();
        pq.pop();
        base += b[id] + x;
        chmax(res[id][1],base);
    }
    return;
}
int main(){
    int n;
    cin >> n;
    a.resize(n);
    rep(i,n) cin >> a[i];
    b.resize(n);
    rep(i,n) cin >> b[i];
    g.resize(n);
    rep(i,n-1){
        int s,t;
        cin >> s >> t;
        s--;t--;
        g[s].push_back(t);
        g[t].push_back(s);
    }
    dfs(0,-1);
    cout << max(res[0][0],res[0][1]) << endl;
    return 0;
}