#include <bits/stdc++.h>
using namespace std;
#define int long long
#define lowbit(x) (x & (-x))
#define debug(x) cerr << #x << ": " << x << endl;
const int N = 2e5 + 10;
int n;
int a[N], t[N];
vector<int> g[N];
int dp[N][2];
int sum[N];
int ans = 0;
void dfs(int u, int fa)
{
    int mx = 0;
    int mx1 = 0, mx2 = 0;
    sum[u] = 0;
    for (auto v : g[u])
    {
        if (v == fa)
            continue;
        dfs(v, u);
        sum[u] += dp[v][0];
        if (sum[mx1] + a[mx1] - dp[mx1][0] < sum[v] + a[v] - dp[v][0])
        {
            mx2 = mx1;
            mx1 = v;
        }
        else if (sum[mx1] + a[mx1] - dp[mx1][0] < sum[v] + a[v] - dp[v][0])
            mx2 = v;
        mx = max(mx, a[v]);
    }
    dp[u][0] = sum[u] + mx;
    //  cerr << u << " " << dp[u][0] << endl;
    // cerr << u << " " << mx1 << " " << mx2 << endl;
    for (auto v : g[u])
    {
        if (v == fa)
            continue;
        if (t[v] == 3)
        {
            if (mx1 == v)
            {
                if (mx2)
                    dp[u][0] = max(dp[u][0], sum[u] - dp[mx2][0] + sum[mx2] + a[mx2] + a[v]);
            }
            else
            {
                // cerr << u << " " << mx1 << endl;
                dp[u][0] = max(dp[u][0], sum[u] - dp[mx1][0] + sum[mx1] + a[mx1] + a[v]);
            }
        }
    }
    return;
}
void solve()
{
    dp[0][0] = 1e18;
    cin >> n;
    for (int i = 1; i <= n; i++)
        cin >> a[i];
    for (int i = 1; i <= n; i++)
        cin >> t[i];
    for (int i = 1; i < n; i++)
    {
        int u, v;
        cin >> u >> v;
        g[u].push_back(v);
        g[v].push_back(u);
    }
    dfs(1, 0);
    cout << dp[1][0] + a[1] << "\n";
    for (int i = 1; i <= n; i++)
    {
        g[i].clear();
        dp[i][1] = dp[i][0] = 0;
    }
    return;
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    cin >> t;
    while (t--)
        solve();
    return 0;
}