#include <bits/stdc++.h>
using namespace std;
const int maxn = 100010;
int T, n, a[maxn], t[maxn];
long long f[maxn];
vector<int> g[maxn];
void dfs(int u, int pre) {
  f[u] = a[u];
  int mx = 0, cmx = 0;
  long long sum = 0;
  for(auto &v : g[u]) if(v != pre) {
    if(t[v] == 3) {
      if (a[v] > mx) cmx = mx, mx = a[v];
      else if (a[v] > cmx) cmx = a[v];
    }
    dfs(v, u), sum += f[v] - a[v];
  }
  for(auto &v : g[u]) if(v != pre) {
    f[u] = max(f[u], a[u] + a[v] + sum);
    if(t[v] == 3 && a[v] == mx) f[u] = max(f[u], sum - f[v] + a[u] + a[v] + cmx);
    else f[u] = max(f[u], sum - f[v] + a[u] + 2 * a[v] + mx);
  }
}
inline void solve() {
  cin >> n;
  for(int i = 1; i <= n; ++i) cin >> a[i];
  for(int i = 1; i <= n; ++i) cin >> t[i];
  for(int i = 1; i < n; ++i) {
    int u, v;
    cin >> u >> v, g[u].push_back(v), g[v].push_back(u);
  }
  dfs(1, 0), cout << f[1] << '\n';
//  for(int i = 1; i <= n; ++i) cout << f[i] << ' '; cout << '\n';
  for(int i = 1; i <= n; ++i) g[i].clear();
}
int main() {
  ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
  cin >> T;
  while(T--) solve();
  return 0;
}