#include <bits/stdc++.h>

using namespace std;

#define endl '\n'
#define pii pair<int, int>
#define i64 long long

const int N = 1e5 + 10;
int n, k;

vector<int> g[N];

int dp[N];
int t[N], a[N];
int sum[N];


void dfs(int u, int fa){
	
	int max_v = 0;
	for (auto v : g[u]){
		if (v == fa) continue;
		dfs(v, u);
		sum[u] += dp[v];
		max_v = max(max_v, a[v]);
	}
	
	dp[u] = sum[u] + max_v;
	if (g[u].size() <= 1) return ;
	
	pii m[2];
	for (auto v : g[u]){
		if (v == fa) continue;
		int x = a[v] + sum[v] - dp[v];
		if (x > m[0].first){
			swap(m[0], m[1]); m[0] = make_pair(x, v);
		}else if (x > m[1].first){
			m[1] = make_pair(x, v);
		}
	}
	
	for (auto v : g[u]){
		if (v == fa) continue;
		if (t[v] == 3){
			if (v != m[0].second){
				dp[u] = max(dp[u], a[v] + sum[u] + m[0].first);
			}else{
				dp[u] = max(dp[u], a[v] + sum[u] + m[1].first);
			}
		}
	}

}

void solve(){
	cin >> n;
	for (int i = 1; i <= n; i ++) cin >> a[i], g[i].clear();
	for (int i = 1; i <= n; i ++) cin >> t[i];
	
	for (int i = 1; i < n; i ++){
		int u, v; cin >> u >> v;
		g[u].push_back(v); g[v].push_back(u);
	}
	for (int i = 1; i <= n; i ++) dp[i] = 0, sum[i] = 0;
	dfs(1, 0);
//	for (int i = 1; i <= n; i ++) cout << dp[i] << endl;
	
	
	cout << dp[1] + a[1] << endl;
	
	
	
}


int main(){
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	int t = 1;
	cin >> t;
	
	while (t --) solve();
}