#include <bits/stdc++.h>
#define all(a) begin(a), end(a)
#define sz(a) (int) (a).size()
#define int long long
using namespace std;

void solve() {
    int n; cin >> n;
    vector<int> a(n + 1);
    vector<int> t(n + 1);
    vector<vector<int> > edg(n + 1);
    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;
        edg[u].push_back(v);
        edg[v].push_back(u);
    }
    vector<int> dp(n + 1, 0);
    vector<int> dpSum(n + 1, 0);
    priority_queue<pair<int, int> > pq;
    auto dfs = [&](auto &&dfs, int id, int par) -> void {
        while (!pq.empty()) pq.pop();
        int maxx = 0, maxi = 0;
        // cout << id << endl; cout.flush();
        for (auto i : edg[id]) {
            if (i == par) continue;
            dfs(dfs, i, id);
            dpSum[id] += dp[i];
            if (a[i] > maxx) {
                maxx = a[i];
                maxi = i;
            }
            pq.push({dpSum[i] - dp[i] + a[i], i});
        }
        dp[id] = dpSum[id] + maxx;
        for (auto i : edg[id]) {
            if (i == par) continue;
            if (t[i] == 3) {
                pair<int, int> tp = pq.top();
                if (tp.second == i) {
                    pair<int, int> tmp = tp;
                    pq.pop();
                    tp = pq.top();
                    pq.push(tmp);
                }
                dp[id] = max(dp[id], dpSum[id] + a[i] + tp.first);
            }
        }
    };
    dfs(dfs, 1, -1);
    cout << dp[1] + a[1] << "\n";
}

int32_t main() {
    cin.tie(0)->sync_with_stdio(false);

    int t = 1; cin >> t;
    while (t--) {
        solve();
    }
}