#include<bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("avx2")

using ll = long long;
//using i128 = __int128_t;
#define endl "\n"
#define int long long
#define db cout << "db" << endl;
#define x first
#define y second
typedef pair<int, int> PII;
const int N = 5e5 + 10;
ll inf = 2e18;
int a[N], t[N], dp[N], f[N], sum[N];
vector<int> edge[N];

int dfs(int u, int pre) {

	int pos1 = 0, pos2 = 0;
	for (auto v : edge[u]) {
		if (v == pre) {
			continue;
		}

		sum[u] += dfs(v, u);
		
		if (t[v] == 3) {
			if (a[v] > a[pos1]) {
				pos1 = v;
			}
		}
		if (a[v] + sum[v] - f[v] > a[pos2] + sum[pos2] - f[pos2]) {
			pos2 = v;
		}
	}

	for (auto v : edge[u]) {
		if (v == pre) {
			continue;
		}
		f[u] = max(f[u], sum[u] + a[v]);
		if (v != pos1) {
			f[u] = max(f[u], sum[u] - f[v] + a[v] + sum[v] + a[pos1]);
			if (t[v] == 3) {
				swap(v, pos1);
				f[u] = max(f[u], sum[u] - f[v] + a[v] + sum[v] + a[pos1]);
			}
		}
	}
	return f[u];
}
void solve() {
    int n;
    cin >> n;
    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);
    }
    dfs(1, 0);
    cout << a[1] + f[1] << endl;
    for (int i = 1; i <= n; i++) {
    	edge[i].clear();
    	f[i] = sum[i] = 0;
    }
    
}
signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    int q = 1;
    cin >> q;
    while (q --) {
        solve();
    }
    return 0;
}