#define GCC optimize(3)
#include <bits/stdc++.h>
using namespace std;

using i64 = int64_t;
using i128 = __int128;

#define IOS ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)

#ifdef DEBUG
    #define cout cout << "\033[1;92m"
    #define endl "\033[0m" << '\n';
#else
    #define endl '\n'
#endif

void solve() {
    int n;
    cin >> n;
    vector<int> a(n+1,0), t(n+1,0);
    for (int i = 1; i <= n; ++i) cin >> a[i];
    for (int i = 1; i <= n; ++i) cin >> t[i];

    vector<vector<int>> edges(n+1);
    for (int i = 1; i <= n-1; ++i) {
        int from, to;
        cin >> from >> to;
        edges[from].push_back(to);
        edges[to].push_back(from);
    }

    vector<int> d1(n+1,0), d2(n+1,0), mx(n+1,0), pa(n+1,0);
    function<void(int,int)> dfs1 = [&](int cur, int fa) -> void {
        pa[cur] = fa;
        if (edges[cur].size() == 1 && edges[cur][0] == fa) {
            d1[cur] = a[cur];
            // mx[cur] = cur;
            return;
        }

        int temp{};
        for (auto&& to : edges[cur]) {
            if (to == fa) continue;

            if (a[to] > temp) {
                temp = a[to];
                mx[cur] = to;
            }
            dfs1(to, cur);
            d1[cur] += d1[to] - a[to];
        }
        d1[cur] += a[mx[cur]] + a[cur];
    };
    dfs1(1, 0);
    pa[1] = 1;

    function<void(int,int)> dfs2 = [&](int cur, int fa) -> void {
        d2[cur] = d1[cur];
        int fi{}, se{}, temp1{}, temp2{};
        for (auto&& to : edges[cur]) {
            if (to == fa || t[to] != 3) continue;
            if (a[to] > temp1) {
                temp1 = a[to];
                fi = to;
            }
            else if (a[to] > temp2) {
                temp2 = a[to];
                se = to;
            }
        }

        for (auto&& to : edges[cur]) {
            if (to == fa) continue;
            if (to == fi) {
                d2[cur] = max(d2[cur], d1[cur] - a[mx[cur]] + a[to] - a[mx[to]] + a[se]);
            }
            else {
                d2[cur] = max(d2[cur], d1[cur] - a[mx[cur]] + a[to] - a[mx[to]] + a[fi]);
            }
            dfs2(to, cur);
        }
    };
    dfs2(1, 0);

    cout << d2[1] << endl;
    
}

signed main() {
    IOS;
    int t{1};
    cin >> t;
    while (t--) {
        solve();
    }

#ifdef _WIN64
    system("pause");
#endif
}