#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int long long
#define endl '\n'
#define PII pair<ll, ll>
const ll N = 1e6 + 5;
const ll M = 1e5 + 5;

ll ans, x, y, n, m, q;
ll a[N];
ll t[N];
vector<ll> ed[N];
ll dp[N];
ll sum[N];
bool vis[N];
void dfs(ll x)
{
    vis[x] = 1;
    priority_queue<PII> tr[2], fl[2];
    for (ll temp : ed[x])
    {
        if (vis[temp])
            continue;
        vis[temp] = 1;
        dfs(temp);
        sum[x] += dp[temp];
        ll tag = t[temp];
        if (tag == 3)
            tag = 1;
        else
            tag = 0;
        tr[tag].push({a[temp], temp});
        fl[tag].push({-dp[temp] + sum[temp] + a[temp], temp});
    }
    ll res = 0;
    for (ll i = 0; i < 2; i++)
    {
        if (!tr[i].empty())
            res = max(res, tr[i].top().first + sum[x]);
        if (fl[i].empty())
            continue;
        PII now = fl[i].top();
        vector<PII> temp;
        while (!tr[1].empty())
        {

            PII u = tr[1].top();
            if (u.second == now.second)
            {
                temp.push_back(u);
                tr[1].pop();
                continue;
            }
            else
            {
                res = max(res, now.first + u.first + sum[x]);
                break;
            }
        }
        while (!temp.empty())
        {
            tr[1].push(temp.back());
            temp.pop_back();
        }
    }
    dp[x] = res;
}
void init()
{
    /*ll ans, x, y, n, m, q;
ll a[N];
ll t[N];
vector<ll> ed[N];
ll dp[N];
ll sum[N];
bool vis[N];*/
    for (ll i = 1; i <= n; i++)
    {
        a[i] = t[i] = 0;
        ed[i].clear();
        dp[i] = 0;
        sum[i] = 0;
        vis[i] = 0;
    }
}
void solve()
{
    cin >> n;
    for (ll i = 1; i <= n; i++)
    {
        cin >> a[i];
    }
    for (ll i = 1; i <= n; i++)
    {
        cin >> t[i];
    }
    for (ll i = 1; i <= n - 1; i++)
    {
        ll x, y;
        cin >> x >> y;
        ed[x].push_back(y);
        ed[y].push_back(x);
    }
    dfs(1);
    // for (ll i = 1; i <= n; i++)
    // {
    //     cout << dp[i] << " ";
    // }
    // cout << endl;
    cout << dp[1] + a[1];
    cout << endl;
    init();
}

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

    ll t = 1;
    cin >> t;
    while (t--)
    {
        solve();
    }

    return 0;
}