#include <bits/stdc++.h>
#define endl '\n'
#define int long long
using namespace std;

const int N = 1e6 + 10;

vector<int> edges[N];
int dp[N][2], f[N][2], g[N],Max[N];
bool state[N];
int val[N];
int pos[N];
#define x first 
#define y second
void dfs(int u, int fa) {
    //dp[u][1] = val[u];
    for (int v : edges[u]) {
        if (v == fa)
            continue;
        dfs(v, u);
        //g[u] = max(g[u], );
    }
    //vector<pair<int,int> > x,y;
    //int ans1=0; int ans2=0;
    int ans=0;
    pair<int,int> a,b;
    int x=0; int y=0;
    for (int v : edges[u]) {
        if (v == fa)
            continue;
        //子树选1，1；
        Max[u]=max(Max[u],dp[v][0]);
        // x.push_back({dp[v][0],v});
        // y.push_back({dp[v][1],v}); 
        x+=dp[v][0];
        y=max(y,val[v]);
        //if(u==1) cout<<v<<endl;
        if(1)
        {
           int temp=Max[v]+val[v];
           if(temp>a.x) 
           {
              b=a;
              a={temp,v};  
           } else if(temp>=b.x) b={temp,v};  
        }
        //if(u==1) cout<<ans<<" "<<dp[u][0]<<endl;
    }
    for(int v:edges[u])
    {
        if(v==fa) continue;
        if(state[v])
        {
         if(a.y==v)
         {
            dp[u][0]=max(dp[u][0],b.x+dp[v][1]);
         }else dp[u][0]=max(dp[u][0],a.x+dp[v][1]);
        }
    }
    dp[u][0]=max(dp[u][0],x+y); 
    dp[u][1]=dp[u][0]+val[u];
return ;
}

void solve() {
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++) {
        edges[i].clear();
        dp[i][0] = dp[i][1] = 0;
        f[i][0] = f[i][1] = 0;
    }
    for (int i = 1; i <= n; i++) {
        cin >> val[i];
    }
    for (int i = 1; i <= n; i++) {
        int t;
        cin >> t;
        state[i] = (t == 3);
    }
    for (int i = 1; i <= n - 1; i++) {
        int u, v;
        cin >> u >> v;
        edges[u].emplace_back(v);
        edges[v].emplace_back(u);
    }
    // for (int i = 1; i <= n; i++) {
    //     sort(edges[i].begin(), edges[i].end(), [&](const auto& p, const auto& q) {
    //         return val[p] > val[q];
    //     });
    //     pos[i] = edges[i].size() > 0 ? edges[i][0] : 0;
    //     f[i][0] = edges[i].size() > 0 ? val[edges[i][0]] : 0;
    //     f[i][1] = edges[i].size() > 1 ? val[edges[i][1]] : 0;
    // }

    dfs(1, 0);
    // for(int i=1;i<=n;i++)
    // {
    //     cout<<Max[i]<<' ';
    //     cout<<dp[i][0]<<" "<<dp[i][1]<<endl;
    // }
    cout << dp[1][1]<< endl;
}

signed main() {
    ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);

    int T = 1;
    cin >> T;
    while (T--) solve();

    return 0;
}