#include<iostream>
#include<cstring>
#include<cmath>
#include<cstdio>
#include<vector>
#include<map>
#include<algorithm>
#include<queue>
#include <iomanip>

#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4.1,sse4.2,avx,avx2,popcnt,tune=native")
using namespace std;
typedef long long LL;
typedef __int128 i128;
typedef unsigned long long ULL;
typedef double db;

#define int long long
const int N = 1e5 + 10;
vector<int>e[N];
int n , a[N] , t[N] , f[N] , g[N];

void dfs(int u , int fa){
	int maxn1 = 0 , maxn2 = 0 , sum = 0;
	for(auto j : e[u]){
		if(j == fa)continue;
		// if(u == 7){
			// cout << j << "hhhhh\n";
		// }
		if(a[j] > maxn1){
			maxn2 = maxn1;
			maxn1 = a[j];
		}else if(a[j] > maxn2){
			maxn2 = a[j];
		}
		dfs(j , u);
		g[u] += g[j];
		sum += g[j];
	}
	int maxn = 0;
	// cout << u << ' ' << maxn1 << ' ' << maxn2 << ' ' << sum << '\n';
	for(auto j : e[u]){
		if(j == fa)continue;
		if(t[j] == 3){
			if(a[j] == maxn1){
				f[u] = max(f[u] , maxn2 + sum + a[j]);
				g[u] = max(g[u] , a[j] + maxn2 + sum);
			}else{
				f[u] = max(f[u] , maxn1 + sum + a[j]);
				g[u] = max(g[u] , a[j] + maxn1 + sum);
			}
		}else{
			// if(a[j] != maxn1){
			f[u] = max(f[u] , sum + maxn1);
			g[u] = max(g[u] , maxn1 + sum);
			// }
			// else{
			// 	f[u] = max(f[u] , sum + maxn2);
			// 	g[u] = max(g[u] , maxn2 + sum);
			// }
		}
	}
	f[u] += a[u];
	return;
}

void Asuka()
{
	cin >> n;
	for(int i = 1 ; i <= n ; i ++){
		cin >> a[i];
		g[i] = f[i] = 0;
		e[i].clear();
	}
	for(int i = 1 ; i <= n ; i ++)
		cin >> t[i];
	for(int i = 1 ; i < n ; i ++){
		int a , b;
		cin >> a >> b;
		e[a].emplace_back(b);
		e[b].emplace_back(a);
	}
	dfs(1 , -1);
	// for(int i = 1 ; i <= n ; i ++){
	// 	cout << f[i] << ' ';
	// }
	// cout << '\n';
	cout << f[1] << '\n';
	return;
}

signed main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);

	int t = 1;
	cin >> t;
	while(t --){
		Asuka();
	}
	return 0;
}