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




void solve() {
    int n; cin >> n;
    vector<int>edge[n + 1],a(n + 1), f(n + 1), g(n + 1), h(n + 1), t(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;
        edge[u].push_back(v);
        edge[v].push_back(u);
    }
    function<void(int, int)>dfs = [&](int u, int fa) {
        h[u] = a[u];
        int first = -1, second = -1, mx = 0, sumg = 0;
        for(auto v : edge[u]) {
            if(v == fa) continue;
            dfs(v, u);
            sumg += g[v];
            mx = max(mx, a[v]);
            if(t[v] == 3) {
                if(a[v] > first) {
                    second = first;
                    first = a[v];
                } else {
                    second = max(second, a[v]);
                }
            }

        }
        g[u] = sumg + mx;
        h[u] += sumg;
        if(first != -1)
            for(auto v : edge[u]) {
                if(v == fa) continue;
                if(first == a[v] && t[v] == 3) {
                    if(second == -1) continue;
                    g[u] = max(g[u], h[v] + sumg + second - g[v]);
                } else {
                    g[u] = max(g[u], h[v] + sumg + first - g[v]);
                }
            }
        f[u] = g[u] + a[u];
    };
    dfs(1, 0);
    cout << f[1] << endl;
}


signed main() {
	// ios::sync_with_stdio(false);
	int tt = 1;
	cin >> tt;
	while (tt--) {
		solve();
	}
}