#include <bits/stdc++.h>
#pragma GCC optimize (3)
#define de(a) cout << #a << " = " << a << "\n";
#define deg(a) cout << #a << " = " << a << " ";
#define lowbit(x) ((x) & (-x))
#define int long long
#define siz(a) ((int)a.size())
#define all(a) a.begin(), a.end()
#define PII pair<int, int>
using ll  = long long;
using ull = unsigned long long;
using namespace std;
constexpr ll inf = 1e18;
constexpr int N = 1e6 + 10;
int n, k;
int a[N], t[N];
    
void solve(int Case) {
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    for (int i = 1; i <= n; i++) {
        cin >> t[i];
    }
    vector<vector<int>> g(n + 1, vector<int>());
    for (int i = 1; i < n; i++) {
        int u, v;
        cin >> u >> v;
        g[u].emplace_back(v);
        g[v].emplace_back(u);
    }
    vector<int> son(n + 1), son3(n + 1), beg(n + 1);
    auto init = [&] (auto init, int u, int f) -> void {
        for (auto v : g[u]) {
            if (v == f) continue;
            if (a[v] > a[son[u]]) {
                son[u] = v;
            }
            if (t[v] == 3 && a[v] > a[son3[u]]) {
                son3[u] = v;
            }
            init(init, v, u);
        }

    }; init(init, 1, 0);    
    auto init1 = [&] (auto init1, int u, int f) -> void {
        int bg = 0;
        for (auto v : g[u]) {
            if (v == f) continue;
            init1(init1, v, u);
            if (v == son3[u]) continue;
            if (a[v] - a[son[v]] > bg) {
                bg = a[v] - a[son[v]];
                beg[u] = v;
            }
        }
    }; init1(init1, 1, 0);

    auto dfs = [&](auto &dfs, int u, int f, int o) -> int {
        int ans = 0;
        if (o) ans += a[u];
        int res1 = 0, res2 = 0;
        if (son3[u] && beg[u]) {
            res1 += dfs(dfs, son3[u], u, 1);
            for (auto v : g[u]) {
                if (v == f || v == son3[u] || v == beg[u]) continue;
                res1 += dfs(dfs, v, u, 0);
            }
            res1 += a[beg[u]];
            for (auto v : g[beg[u]]) {
                if (v == u) continue;
                res1 += dfs(dfs, v, beg[u], 0);
            }
        } 
        {
            if (son[u]) res2 += dfs(dfs, son[u], u, 1);
            for (auto v : g[u]) {
                if (v == f || v == son[u]) continue;
                res2 += dfs(dfs, v, u, 0);
            }
        }
        ans += max(res1, res2);
        return ans;
    }; 
    cout << dfs(dfs, 1, 0, 1) << "\n";
}   

signed main() {
    cin.tie(0)->ios::sync_with_stdio(false);
    int T = 1;
    cin >> T; cin.get();

    int Case = 0;
    while (++Case <= T) {
        solve(Case);
    }

    return 0;
}