1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
# define Fast_IO std::ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
# include "unordered_map"
# include "algorithm"
# include "iostream"
# include "cstdlib"
# include "cstring"
# include "cstdio"
# include "vector"
# include "bitset"
# include "queue"
# include "cmath"
# include "map"
# include "set"
 
using namespace std;
 
const int maxm=1e5+10;
 
int Task,N;
long long A[maxm];
int T[maxm];
long long F[maxm],G[maxm],H[maxm];

vector<int> Edge[maxm];
 
void Dfs(int Now,int Father){
	long long Max1,Max2,Max; Max=Max1=Max2=0;
	long long Res=0;
	for(auto To:Edge[Now]){
		if(To==Father) continue;
		Dfs(To,Now);
	}H[Now]=A[Now];
	for(auto To:Edge[Now]){
		if(To==Father) continue;
		H[Now]+=G[To];
	}
	for(auto To:Edge[Now]){
		if(To==Father) continue;
		Res+=G[To];
		Max=max(A[To],Max);
	}G[Now]=Res+Max;
	Max1=Max2=0;
	for(auto To:Edge[Now]){
		if(To==Father || T[To]!=3) continue;
		if(A[To]>=Max1) Max2=Max1,Max1=A[To];
		else Max2=max(Max2,A[To]);
	}
	for(auto To:Edge[Now]){
		if(To==Father) continue;
		if(A[To]!=Max1 || T[To]!=3) G[Now]=max(G[Now],Res-G[To]+H[To]+Max1);
		else G[Now]=max(G[Now],Res-G[To]+H[To]+Max2);
	}
	F[Now]=G[Now]+A[Now];
	return;
}
 
inline void Solve(){
	static int i,U,V;
	scanf("%d",&N);
	for(i=1;i<=N;i++) Edge[i].clear(),F[i]=G[i]=false;
	for(i=1;i<=N;i++) scanf("%lld",&A[i]);
	for(i=1;i<=N;i++) scanf("%d",&T[i]);
	for(i=1;i< N;i++){
		scanf("%d%d",&U,&V);
		Edge[U].push_back(V);
		Edge[V].push_back(U);
	}Dfs(1,1);
	printf("%lldn",F[1]);
	return;
}
 
int main(){
	scanf("%d",&Task);
	while(Task--) Solve();
	return 0;
}