#include <bits/stdc++.h>
#define endl '\n'
#define int long long
using namespace std;

const int N = 1e6 + 10;

vector<int> edges[N];
int dp[N][2];
int g[N][2];
int pos[N];
int sum[N];
bool state[N];
int val[N];

void dfs(int u, int fa) {
    sum[u] = 0;
    for (int v : edges[u]) {
        if (v == fa)
            continue;
        dfs(v, u);
        sum[u] += dp[v][0];
        if (dp[v][1] + val[v] - dp[v][0] > g[u][0]) {
            pos[u] = v;
            g[u][0] = dp[v][1] + val[v] - dp[v][0];
        }
        else if (dp[v][1] + val[v] - dp[v][0] > g[u][1]) {
            g[u][1] = dp[v][1] + val[v] - dp[v][0];
        }
    }
    for (int v : edges[u]) {
        if (v == fa)
            continue;
        if (state[v]) {
            dp[u][0] = max(dp[u][0], sum[u] + val[v] + (pos[u] == v ? g[u][1] : g[u][0]));
        }
        else {
            dp[u][0] = max(dp[u][0], sum[u] + (pos[u] == v ? g[u][1] : g[u][0]));
            dp[u][0] = max(dp[u][0], sum[u] + val[v]);
        }
        dp[u][1] += dp[v][0];
    }
}

void solve() {
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++) {
        edges[i].clear();
        dp[i][0] = dp[i][1] = 0;
        g[i][0] = g[i][1] = 0;
        pos[i] = 0;
    }
    for (int i = 1; i <= n; i++) {
        cin >> val[i];
    }
    for (int i = 1; i <= n; i++) {
        int t;
        cin >> t;
        state[i] = (t == 3);
    }
    for (int i = 1; i <= n - 1; i++) {
        int u, v;
        cin >> u >> v;
        edges[u].emplace_back(v);
        edges[v].emplace_back(u);
    }
    dfs(1, 0);
    cout << dp[1][0] + val[1] << endl;
}

signed main() {
    ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);

    int T = 1;
    cin >> T;
    while (T--) solve();

    return 0;
}