import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


enum INF = 10L^^18;

int N;
long[] A, B;
int[] U, V;

int[][] G;
long[][] dp;

void dfs(int u, int p) {
  dp[u] = [0, A[u]];
  foreach (i; G[u]) {
    const v = U[i] ^ V[i] ^ u;
    if (v != p) {
      dfs(v, u);
      foreach (s; 0 .. 2) {
        long mx = -INF;
        foreach (t; 0 .. 2) {
          long score = dp[v][t];
          if (s == 0 && t == 0) {
            score += B[u] + B[v];
          }
          chmax(mx, score);
        }
        dp[u][s] += mx;
      }
    }
  }
}

void main() {
  try {
    for (; ; ) {
      N = readInt();
      A = new long[N];
      foreach (u; 0 .. N) {
        A[u] = readLong();
      }
      B = new long[N];
      foreach (u; 0 .. N) {
        B[u] = readLong();
      }
      U = new int[N - 1];
      V = new int[N - 1];
      foreach (i; 0 .. N - 1) {
        U[i] = readInt() - 1;
        V[i] = readInt() - 1;
      }
      
      G = new int[][N];
      foreach (i; 0 .. N - 1) {
        G[U[i]] ~= i;
        G[V[i]] ~= i;
      }
      dp = new long[][](N, 2);
      dfs(0, -1);
      const ans = dp[0].maxElement;
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}