#include<bits/stdc++.h>
using namespace std;
#define fast ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define For(i,j,k) for (int i=(j);i<=(k);i++)
#define rof(i,j,k) for (int i=(j);i>=(k);i--)
#define ull unsigned long long
#define lowbit(x) ((x)&(-(x)))
#define PII pair<int,int>
#define int long long
#define endl "\n"
#define ls rt<<1
#define rs rt<<1|1
typedef long long ll;
const int mod = 998244353;
const double eps = 1e-9;
const int N=2e6+7;
int n,m;
int a[N],t[N],f[N],h[N],g[N];
vector<int> e[N];
void dfs(int u,int fa){
    int fi=-1,se=-1,sumg=0,mx=0;
    h[u]=a[u];
    for(int i=0;i<e[u].size();i++){
        int to=e[u][i];
        if(to==fa) continue;
        dfs(to,u);
        if(t[to]==3){
            if(a[to]>=fi) se=fi,fi=a[to];
            else se=max(se,a[to]);
        }
        sumg+=g[to];
        h[u]+=g[to];
        mx=max(mx,a[to]);
    }
    g[u]=mx+sumg;
    if(fi!=-1){
        for(int i=0;i<e[u].size();i++){
            int to=e[u][i];
            if(to==fa) continue;
            if(fi==a[to]&&t[to]==3){
                if(se==-1) continue;
                g[u]=max(g[u],h[to]+sumg-g[to]+se);
            }else{
                g[u]=max(g[u],h[to]+sumg-g[to]+fi);
            }
        }
    }
    f[u]=g[u]+a[u];
}
void solve(){
	cin>>n;
    for(int i=1;i<=n;i++){
        f[i]=g[i]=h[i]=a[i]=t[i]=0;
        e[i].clear();
    }
	for(int i=1;i<=n;i++){
        cin>>a[i];
    }
    for(int i=1;i<=n;i++){
        cin>>t[i];
    }
    for(int i=1;i<n;i++){
        int u,v;
        cin>>u>>v;
        e[u].push_back(v);
        e[v].push_back(u);
    }
    dfs(1,0);
    cout<<f[1]<<endl;
}
signed main(){
	int t=1;
	cin>>t;
	while(t--){
		solve();
	}
}