#include <bits/stdc++.h>
using namespace std;
#define xx first
#define yy second
#define endl "\n"
#define pb push_back
#define int long long
#define ll long long
#define lowbit(x) x & (-x)
typedef pair<int, int> pii;
#define LF(x) fixed << setprecision(x)
#define Yshanqian ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
const int N = 1e6 + 10, M = 1010, inf = 0x3f3f3f3f, mod = 1e9 + 7, P = 13331;
int n;
int a[N], t[N];
int dp[N], f[N];
vector<int> g[N];
void dfs(int u, int fa)
{
    int s = 0;
    int mx1 = 0, mx2 = 0, mx3 = 0;

    int ndp1 = 0, ndp2 = 0;

    vector<pii> t1(2), t2(2);

    for (auto v : g[u])
    {
        if (v == fa)
            continue;
        if (t[v] == 1)
            mx1 = max(mx1, a[v]);
        else if (t[v] == 2)
            mx2 = max(mx2, a[v]);
        else
            mx3 = max(mx3, a[v]);
    }

    for (auto v : g[u])
    {
        if (v == fa)
            continue;

        dfs(v, u);

        s += dp[v];

        if (t[v] != 3)
            ndp1 = max(ndp1, a[v] + f[v] - dp[v]);
        else
        {
            if (a[v] >= t1[0].xx)
                t1[1] = t1[0], t1[0] = {a[v], v};
            else if (a[v] > t1[1].xx)
                t1[1] = {a[v], v};

            if (a[v] + f[v] - dp[v] >= t2[0].xx)
                t2[1] = t2[0], t2[0] = {a[v] + f[v] - dp[v], v};
            else if (a[v] + f[v] - dp[v] > t2[0].xx)
                t2[1] = {a[v] + f[v] - dp[v], v};
        }
    }

    for (int i = 0; i < 2; i++)
    {
        for (int j = 0; j < 2; j++)
        {
            if (t1[i].yy != t2[j].yy)
                ndp2 = max(ndp2, t1[i].xx + t2[j].xx);
        }
    }

    f[u] = dp[u];
    dp[u] = max({s + mx1, s + mx2, s + mx3, s + ndp1 + mx3, s + ndp2});
}
void solve()
{
    cin >> n;
    for (int i = 1; i <= n; i++)
    {
        a[i] = t[i] = 0;
        dp[i] = f[i] = 0;
        g[i].clear();
    }
    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 - 1; i++)
    {
        int a, b;
        cin >> a >> b;
        g[a].pb(b);
        g[b].pb(a);
    }
    dfs(1, 0);
    // for (int i = 1; i <= n; i++)
    //     cout << i << ": " << dp[i] << " " << f[i] << endl;

    cout << dp[1] + a[1] << endl;
}
signed main()
{
    Yshanqian;
    int T;
    T = 1;
    cin >> T;
    for (int cases = 1; cases <= T; ++cases)
    {
        // cout<<"Case #"<<cases<<": ";
        solve();
    }
    return 0;
}