#include <bits/stdc++.h>

using namespace std;

const int N = 1e5 + 5;

int a[N], t[N];
long long f[N][2];
vector<int> G[N];

void dfs(int x, int fa = -1) {
    f[x][1] = a[x];
    long long mx = 0, mx1 = -1e18, mx2 = -1e18;
    for (auto v : G[x]) if (v != fa) {
        dfs(v, x), f[x][1] += f[v][0] - a[v];
        mx = max(mx, (long long)a[v]);
        if (t[v] == 3) mx = max(mx, mx1 + a[v]);
        mx1 = max(mx1, f[v][1] - f[v][0] + a[v]);
        mx = max(mx, mx2 + f[v][1] - f[v][0] + a[v]);
        if (t[v] == 3) mx2 = max(mx, (long long)a[v]);
    }
    f[x][0] = f[x][1] + mx;
}

signed main() {
    int T; scanf("%d", &T);
    while (T--) {
        int n; scanf("%d", &n);
        for (int i = 1; i <= n; ++i) {
            scanf("%d", &a[i]);
        }
        for (int i = 1; i <= n; ++i) {
            scanf("%d", &t[i]);
            G[i].clear();
        }
        for (int i = 1, x, y; i < n; ++i) {
            scanf("%d%d", &x, &y);
            G[x].push_back(y), G[y].push_back(x);
        }
        dfs(1);
        printf("%lld\n", f[1][0]);
    }
    return 0;
}