#include<bits/stdc++.h> 
using namespace std;
#define fer(i,a,b) for(int i=a;i<=b;i++)
#define fdr(i,a,b) for(int i=a;i>=b;i--)
#define int long long
#define xx first
#define yy second
#define pb push_back
#define ps push
#define db double
#define P pair<int,int>
#define endl '\n'
#define ll long long
const int N=2e5+10;
const int mod=1e9+7;
const int INF=1e18+10;
priority_queue<int,vector<int>,greater<int>> pq;

int n;
int t[N];
int a[N],f[N],sum[N];
vector<int> g[N];

int dfs(int u,int fa){
	int mx=0;
	multiset<int> st;
	for(int v:g[u]){
		if(v==fa) continue;
		dfs(v,u);
		sum[u]+=f[v];
		mx=max(mx,a[v]);
		if(t[v]==3LL) st.insert(a[v]);
	}
	f[u]=sum[u]+mx;
	st.insert(-INF);
	for(int v:g[u]){
		if(v==fa) continue;
		if(t[v]==3LL) st.erase(st.find(a[v]));
		f[u]=max(f[u],sum[u]-f[v]+sum[v]+a[v]+*st.rbegin());
		if(t[v]==3LL) st.insert(a[v]);
	}
}

void solve(){
	cin>>n;
	fer(i,1,n) g[i].clear(),f[i]=sum[i]=0;
	fer(i,1,n) cin>>a[i];
	fer(i,1,n) cin>>t[i];
	fer(i,1,n-1){
		int u,v;
		cin>>u>>v;
		g[u].pb(v);
		g[v].pb(u);
	}
	dfs(1,0);
	cout<<f[1]+a[1]<<endl;
	
}

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