#include <bits/stdc++.h>
using namespace std;
int n, a[100005], t[100005];
long long sum[100005], dp[100005];
vector<int> G[100005];
void dfs(int u, int fa) {
	dp[u] = sum[u] = 0;
	int mx1 = -1e9, mx2 = -1e9, id1 = 0, id2 = 0;
	for (int v : G[u]) {
		if (v == fa) continue;
		dfs(v, u);
		sum[u] += dp[v];
		dp[u] = max(dp[u], 1ll * a[v]);
		if (t[v] >= 3) {
			if (a[v] >= mx1) {
				id2 = id1, mx2 = mx1;
				mx1 = a[v], id1 = v;
			} else if (a[v] >= mx2)
				id2 = v, mx2 = a[v];
		}
	}
	dp[u] += sum[u];
	for (int w : G[u]) {
		if (w == id1)
			dp[u] = max(dp[u], sum[u] - dp[w] + mx2 + sum[w] + a[w]);
		else
			dp[u] = max(dp[u], sum[u] - dp[w] + mx1 + sum[w] + a[w]);
	}
}
int main() {
	int T;
	cin >> T;
	while (T--) {
		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]);
		for (int i = 1; i <= n; ++i) G[i].clear();
		for (int i = 1; i < n; ++i) {
			int u, v;
			scanf("%d%d", &u, &v);
			G[u].push_back(v);
			G[v].push_back(u);
		}
		dfs(1, 0);
//		for (int i = 1; i <= n; ++i)
//			printf("dp[%d]:%lld\n", i, dp[i]);
		printf("%lld\n", dp[1] + a[1]);
	}
	return 0;
}