#include <bits/stdc++.h>
using namespace std;

using i64 = long long;

void solve() {
  int n;
  cin >> n;
  vector<int> a(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  vector<int> t(n);
  for (int i = 0; i < n; i++) {
    cin >> t[i];
  }
  vector<vector<int>> g(n);
  for (int i = 1; i < n; i++) {
    int u, v;
    cin >> u >> v;
    u--, v--;
    g[u].push_back(v);
    g[v].push_back(u);
  }
  i64 ans = a[0];
  auto dfs = [&](auto dfs, int u, int fa) -> void {
    multiset<int> sa, sb;
    for (auto v : g[u]) if (v != fa) {
      if (t[v] <= 2) {
        sa.insert(a[v]);
      } else {
        sb.insert(a[v]);
      }
      dfs(dfs, v, u);
    }
    if (sb.size()) {
      ans += *sb.rbegin();
      sb.erase(prev(sb.end()));
    }
    int mx = -1e9;
    if (sa.size()) mx = max(mx, *sa.rbegin());
    if (sb.size()) mx = max(mx, *sb.rbegin());
    if (mx != -1e9) ans += mx;
  };
  dfs(dfs, 0, 0);
  cout << ans << "\n";
}

int main() {
  cin.tie(0)->sync_with_stdio(0);
  int t;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}