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

using ll = long long;
const int N = 1e5 + 10;

int head[N], e[2 * N], ne[2 * N], t[N];
ll dp[N][2], w[N];
int idx, n;

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

inline void dfs(int u, int fa)
{
    int flag = 1;
    int M = 0;
    ll sum = 0;
    for (int i = head[u]; i; i = ne[i])
    {
        int v = e[i];
        if (v != fa)
        {
            flag = 0;
            dfs(v, u);

            if (w[v] > w[M])
                M = v;

            sum += dp[v][1];
        }
    }

    if (flag)
    {
        dp[u][1] = 0;
        dp[u][0] = 0;
        return;
    }

    dp[u][0] = sum;
    dp[u][1] = sum + w[M];

    ll x = 0, xx = 0;
    int vx, vxx;

    for (int i = head[u]; i; i = ne[i])
    {
        int v = e[i];
        if (v != fa)
        {
            ll y = w[v] - dp[v][1] + dp[v][0];
            if (y > x)
            {
                xx = x, vxx = vx;
                x = y, vx = v;
            }
            else if (y > xx)
            {
                xx = y, vxx = v;
            }
        }
    }

    for (int i = head[u]; i; i = ne[i])
    {
        int v = e[i];
        if (v != fa && t[v] == 3)
        {
            dp[u][1] = max(dp[u][1], sum + x + w[v]);
        }
    }
}

void solve()
{
    cin >> n;
    for (int i = 1; i <= n; i++)
    {
        cin >> w[i];
        head[i] = 0;
        dp[i][0] = dp[i][1] = 0;
    }
    for (int i = 1; i <= n; i++)
        cin >> t[i];

    int a, b;
    for (int i = 1; i < n; i++)
    {
        cin >> a >> b;
        add(a, b), add(b, a);
    }

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

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

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