#include <cstdio>
const int maxn = 100000;
int n;
int a[maxn + 10];
int t[maxn + 10];

struct node{
	int nxt;
	int to;
}edge[maxn * 2 + 10];
int head[maxn + 10];
int top;
void add_e(int u, int v){
	++top;
	edge[top].nxt = head[u];
	edge[top].to = v;
	head[u] = top;
	return ;
}

long long dp[maxn + 10][2];
void dfs(int x, int fa){
	dp[x][0] = dp[x][1] = 0;
	int ap1 = 0, ap2 = 0;
	for(int i = head[x]; i; i = edge[i].nxt){
		int y = edge[i].to;
		if(y != fa){
			dfs(y, x);
			if(a[ap1] < a[y]){
				ap1 = y;
			}
			if(t[y] == 3 && a[ap2] < a[y]){
				ap2 = y;
			}
			dp[x][1] = dp[x][1] + dp[y][0];
		}
	}
	//第一种，不管t=3 
	dp[x][0] = dp[x][1] + a[ap1];
	//第二种，考虑t=3 
	for(int i = head[x]; i; i = edge[i].nxt){
		int y = edge[i].to;
		if(y != fa){
			long long temp = dp[x][1] + a[ap2] - dp[y][0] + dp[y][1] + a[y];
			if(dp[x][0] < temp){
				dp[x][0] = temp;
			}
		}
	}
}

int main(){
	int T;
	scanf("%d", &T);
	while(T--){
		scanf("%d", &n);
		for(int i = 1; i <= n; ++i){
			scanf("%d", &a[i]);
		}
		for(int i = 1; i <= n; ++i){
			scanf("%d", &t[i]);
		}
		int u, v;
		for(int i = 1; i < n; ++i){
			scanf("%d%d", &u, &v);
			add_e(u, v);
			add_e(v, u);
		}
		dfs(1, 0);
		
		printf("%lld\n", dp[1][0] + a[1]);
		
		top = 0;
		for(int i = 1; i <= n; ++i){
			head[i] = 0;
		}
	}
	return 0;
}