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

const int N = 1e6 + 10;

int h[N], e[N], ne[N], idx = 1;

void add(int a, int b)
{
    e[idx] = b, ne[idx] = h[a], h[a] = idx++;
}

int a[N], t[N], f[N], ans = 0;

void dfs(int u, int fa)
{
    if (!h[u])
        return;
    for (int i = h[u]; i; i = ne[i])
    {
        int v = e[i];
        if (fa != v)
            dfs(v, u);
    }

    int m = 0, mm = 0;
    for (int i = h[u]; i; i = ne[i])
    {
        int v = e[i];
        if (v == fa)
            continue;
        if (a[v] > a[m])
        {
            mm = m;
            m = v;
        }
        else if (a[v] > a[mm])
        {
            mm = v;
        }
    }
    // cerr << u << '\n';
    // cerr << m << " " << mm << '\n';
    f[u] = a[m] + a[mm];

    if (t[m] == 1 && t[mm] == 3)
    {
        ans -= min(a[mm], f[m]);
    }
    else if (t[m] == 3 && t[mm] == 3)
    {
        ans -= min({a[mm], f[m], f[mm]});
    }
    else if (t[m] == 3 && t[mm] == 1)
    {
        ans -= min(a[mm], f[mm]);
    }
    else if (t[m] == 1 && t[mm] == 1)
    {
        ans -= a[mm];
    }

    ans += f[u];
}

void solve()
{
    int n;
    cin >> n;

    for (int i = 1; i <= n; i++)
        h[i] = 0, f[i] = 0;
    idx = 1;
    ans = 0;
    for (int i = 1; i <= n; i++)
        cin >> a[i];
    for (int i = 1; i <= n; i++)
    {
        cin >> t[i];
        if(t[i] == 2)
            t[i] = 1;
    }
    int u, v;
    for (int i = 1; i < n; i++)
    {
        cin >> u >> v;
        add(u, v);
        add(v, u);
    }
    dfs(1, 0);

    cout << ans + a[1] << '\n';
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    int T;
    cin >> T;

    while (T--)
        solve();

    return 0;
}