#include<iostream>
#include<cstring>
#include<cmath>
#include<cstdio>
#include<vector>
#include<map>
#include<algorithm>
#include<queue>
#include <iomanip>

#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4.1,sse4.2,avx,avx2,popcnt,tune=native")
using namespace std;
typedef long long LL;
typedef __int128 i128;
typedef unsigned long long ULL;
typedef double db;

#define int long long
const int N = 1e5 + 10;
vector<int>e[N];
int n , a[N] , t[N] , f[N];

struct node {
    int u, f, t;
};

bool cmp(node a, node b)
{
    if (a.f != b.f) return a.f > b.f;
    else return a.t < b.t;
}

void dfs(int u , int fa){
    f[u] = a[u];
    vector<node> v;
    for (int i = 0; i < e[u].size(); i ++ )
    {
        int j = e[u][i];
        if (j == fa) continue;
        dfs(j, u);
        v.push_back({j, a[j], t[j]});
    }
    sort(v.begin(), v.end(), cmp);
    bool flag = false;
    for (int i = 0; i < v.size(); i ++ )
    {
        int j = v[i].u;
        if (i == 0) f[u] += f[j];
        else
        {
            if (v[i].t == 3 && !flag) f[u] += f[j];
            else f[u] += f[j] - a[j];
            if (v[i].t == 3) flag = true;
        }
    }
}

void Asuka()
{
    cin >> n;
    for(int i = 1 ; i <= n ; i ++){
        cin >> a[i];
        f[i] = 0;
        e[i].clear();
    }
    for(int i = 1 ; i <= n ; i ++)
        cin >> t[i];
    for(int i = 1 ; i < n ; i ++){
        int a , b;
        cin >> a >> b;
        e[a].emplace_back(b);
        e[b].emplace_back(a);
    }
    dfs(1 , -1);
    cout << f[1] << '\n';
    return;
}

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

    int t = 1;
    cin >> t;
    while(t --){
        Asuka();
    }
    return 0;
}