#include <bits/stdc++.h>
#define INF 2e9
using namespace std;
const int MAXN=1e5+10;

vector<int>g[MAXN];
int n,u, v;
int a[MAXN];
int f[MAXN], sum[MAXN], t[MAXN];
void dfs(int u,int fa) {
	int mx = 0;
	multiset<int>st;//维护t[v] = 3的点的最大值
	for (int v : g[u]) {
		if (v == fa)continue;
		dfs(v, u);
		sum[u] += f[v];
		mx = max(mx, a[v]);//找到a[v]的最大值
		if (t[v] == 3)st.insert(a[v]);//把t[v] = 3 的点放进来
	}
	f[u] = sum[u] + mx;
	st.insert(-INF);
	for (int v : g[u]) {
		if (v == fa)continue;
		if (t[v] == 3)st.erase(st.find(a[v]));
		f[u] = max(f[u],sum[u] - f[v] + a[v] + sum[v] + *st.rbegin());
		if (t[v] == 3)st.insert(a[v]);//注意不要忘了添加回去
	}
}
void slove() {
	cin >> n;
	for (int i = 1; i <= n; i++)g[i].clear(), f[i] = sum[i] = 0;
	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 - 1; i++) {
		cin >> u >> v;
		g[u].push_back(v);
		g[v].push_back(u);
	}
	dfs(1, 0);
	cout << f[1] + a[1] << endl;
}
int main()
{
	int t;
	cin>>t;
	while(t--)
	{
		slove();
	}
	return 0;
}