#include<bits/stdc++.h>

using i64 = long long;

void solve() {
    int n;
    std::cin >> n;
    std::vector<i64> a(n + 1), f(n + 1);
    std::vector<int> t(n + 1);
    std::vector<std::vector<int>> v(n + 1);
    for (int i = 1; i <= n; i++)std::cin >> a[i];
    for (int i = 1; i <= n; i++)std::cin >> t[i];
    for (int i = 1; i < n; i++) {
        int x, y;
        std::cin >> x >> y;
        v[x].push_back(y);
        v[y].push_back(x);
    }
    auto dfs = [&](auto &&self, int x, int fa) -> void {
        i64 sum = 0, max = 0;
        std::multiset<i64, std::greater<>> q;
        for (int i: v[x]) {
            if (i == fa)continue;
            self(self, i, x);
            sum += f[i];
            max = std::max(max, a[i]);
            q.insert(a[i] - f[i]);
        }
        f[x] = sum + max;
        for (int i: v[x]) {
            if (i == fa || t[i] < 3)continue;
            q.erase(q.find(a[i] - f[i]));
            f[x] = std::max(f[x], sum + *q.begin() + a[i]);
            q.insert(a[i] - f[i]);
        }
    };
    dfs(dfs, 1, 0);
    std::cout << f[1] + a[1] << '\n';
}

int main() {
    std::ios::sync_with_stdio(false), std::cin.tie(nullptr);
    int CZY;
    std::cin >> CZY;
    while (CZY--)solve();
}