#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

void solve() {
    int n; cin>>n;
    int t[n+5];
    ll a[n+5],dp[n+5][2];
    memset(a,0,sizeof(a));
    memset(dp,0,sizeof(dp));
    vector<int> adj[n+5];
    for (int i=1; i<=n; ++i) cin>>a[i];
    for (int i=1; i<=n; ++i) cin>>t[i];
    for (int i=0; i<n-1; ++i) {
        int x,y; cin>>x>>y;
        adj[x].push_back(y);
        adj[y].push_back(x);
    }

    function<void(int,int)> dfs=[&](int x, int par)  {
        if (adj[x].size()==1 && adj[x][0]==par) return;
        int mx1=0,mx2=0;
        ll sum=0,mx=-INT_MAX;
        for (auto s : adj[x]) if (s!=par) {
            dfs(s,x);
            sum+=dp[s][1];
            mx=max(mx,a[s]);
            if (t[s]==3) {
                if (mx1==0 || a[s]>=a[mx1]) {
                    mx2=mx1;
                    mx1=s;
                } else if (mx2==0 || a[s]>a[mx2]) mx2=s;
            }
        }
        dp[x][0]=sum;

        //go directly
        dp[x][1]=sum+mx;

        //go to c first
        for (auto c : adj[x]) if (c!=par) {
            if (c==mx1) dp[x][1]=max(dp[x][1],a[c]+dp[c][0]+sum-dp[c][1]+a[mx2]);
            else dp[x][1]=max(dp[x][1],a[c]+dp[c][0]+sum-dp[c][1]+a[mx1]);
        }
    };

    dfs(1,0);
    cout<<dp[1][1]+a[1]<<"\n";
}

int main () {
    ios_base::sync_with_stdio(0); cin.tie(0);
    int t; cin>>t;
    while (t--) solve();
}