#include <bits/stdc++.h>
using namespace std;
using LL = long long;

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

    vector<int> b(n);
    
    for (int i = 0; i < n; ++i) {
        cin >> b[i];
        if (b[i] == 2) {
            b[i] = 1;
        }
    }
    vector<vector<int>> e(n);

    for (int i = 0; i < n - 1; ++i) {
        int u, v;
        cin >> u >> v;
        --u, --v;
        e[u].push_back(v);
        e[v].push_back(u);
    }

    vector<LL> f(n), g(n);
    vector<int> fa(n, -1);

    auto dfs = [&](auto &&self, int u) -> void{
        f[u] = 0;
        LL mx = 0;
        LL sum = a[u];
        for (int v : e[u]) {
            if (v == fa[u]) {
                continue;
            }
            fa[v] = u;
            self(self, v);
            sum += f[v] - a[v];
            mx = max(mx, a[v]);
        }

        f[u] = mx + sum;
        mx = 0;

        for (int v : e[u]) {
            if (v == fa[u]) {
                continue;
            }
            if (b[v] == 3) {
                f[u] = max(f[u], mx + a[v]);
            }

            mx = max(mx, sum - (f[v] - a[v]) + a[v] + g[v]);
        }

        mx = 0;
        for (auto it = e[u].rbegin(); it != e[u].rend(); it++) {
            int v = *it;
            if (v == fa[u]) {
                continue;
            }
            if (b[v] == 3) {
                f[u] = max(f[u], mx + a[v]);
            }

            mx = max(mx, sum - (f[v] - a[v]) + a[v] + g[v]);
        }

        int ff = u;
        for (int i = 0; i < 2; ++i) {
            ff = fa[ff];
            if (ff == -1) {
                break;
            }
        }

        if (ff != -1) {
            g[ff] += f[u] - a[u];
        }
    };

    dfs(dfs, 0);
    cout << f[0] << '\n';
}


int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int t;
    cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}