#include<bits/stdc++.h>
#define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl '\n'
#define fixed(s) fixed<<setprecision(12)<<s
//#define int long long
 
using namespace std;
 
typedef pair<int, int> PII;
typedef long long ll;
typedef pair<ll, PII> PLII;

const int N = 100010;

int n;
ll dp[N][2], son[N];
ll a[N], tim[N];
vector<int> g[N];

void dfs(int u, int fa)
{
	for(auto j : g[u])
	{
		if(j == fa)continue;
		
		dfs(j, u);
	}
	
	dp[u][0] = 0, dp[u][1] = a[u];
	
	ll sum = 0;
	for(auto j : g[u])
	{
		if(j == fa)continue;
		
		sum += dp[j][0];
	}
	
	for(auto j : g[u])//先不考虑三 
	{
		if(j == fa)continue;
		
		dp[u][0] = max(dp[u][0], sum + a[j]);
	}
	
	ll max1 = 0, max2 = 0;
	for(auto j : g[u])
	{
		if(j == fa)continue;
		
		ll ret = a[j] - son[j];
		if(ret > max1)max2 = max1, max1 = ret;
		else if(ret > max2)max2 = ret;
	}
	
	ll ttt1, ttt2 = 0;
	
	for(auto j : g[u])
	{
		if(j == fa)continue;
		
		if(tim[j] == 3)
		{
			ll ret = a[j] - son[j], t;
			if(ret == max1)t = max2;
			else t = max1;
			
			if(sum + t + a[j] > dp[u][0])
			{
				dp[u][0] = max(dp[u][0], sum + t + a[j]);
				ttt1 = t, ttt2 = j;
			}
			
		}
	}
	dp[u][1] = dp[u][0] + a[u];
	
	for(auto j : g[u])//先不考虑三 
	{
		if(j == fa)continue;
		
		//dp[u][0] = max(dp[u][0], sum + a[j]);
		if(dp[u][0] == sum + a[j])
		{
			son[u] = a[j];
			return;
		}
	}
	
	son[u] += a[ttt2];
	for(auto j : g[u])
	{
		if(j == fa)continue;
		
		ll ret = a[j] - son[j];
		if(ret == ttt1)
		{
			son[u] += a[j];
			return;
		}
	}
}

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

int main()
{
	IOS
	int _;
	cin >> _;
	while(_ --)
	{
		solve();
	}
	
	return 0;
}