#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007;
// const int MOD = 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
const int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n; cin >> n;
  vector<int> a(n), b(n);
  REP(i, n) cin >> a[i];
  REP(i, n) cin >> b[i];
  vector<vector<int>> graph(n);
  REP(_, n - 1) {
    int u, v; cin >> u >> v; --u; --v;
    graph[u].emplace_back(v);
    graph[v].emplace_back(u);
  }
  function<tuple<ll, ll, ll>(int, int)> dfs = [&](int par, int ver) {
    // ox, oo, x
    ll r = a[ver], sum = 0;
    vector<ll> diff;
    for (int e : graph[ver]) {
      if (e == par) continue;
      auto [pe, qe, re] = dfs(ver, e);
      r += max(pe, re);
      sum += re;
      diff.emplace_back(qe - re);
    }
    sort(ALL(diff), greater<ll>());
    ll p = sum, q = b[ver] + sum;
    REP(i, diff.size()) {
      sum += diff[i];
      chmax(p, 1LL * b[ver] * (i + 1) + sum);
      chmax(q, 1LL * b[ver] * (i + 2) + sum);
    }
    return make_tuple(p, q, r);
  };
  auto [p, q, r] = dfs(-1, 0);
  cout << max(p, r) << '\n';
  return 0;
}