#include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(), a.end()
void print() { cout << '\n'; }
template <typename T, typename...Args>
void print(T t, Args...args) { cout << t << ' '; print(args...); }
using ll = long long;
const int N = 2e6 + 5, base = 1e6;

template <typename T>
void chmax (T& x, T y) {
    x = max(x, y);
}

void solve () {
    int n;
    cin >> n;
    
    vector<int> a(n), t(n);
    for (int i = 0; i < n; i ++) {
        cin >> a[i];
    }
    for (int i = 0; i < n; i ++) {
        cin >> t[i];
    }
    
    vector<vector<int>> e(n);
    for (int i = 1; i < n; i ++) {
        int u, v;
        cin >> u >> v;
        u --;
        v --;
        e[u].push_back(v);
        e[v].push_back(u);
    }
    
    if (n == 1) {
        cout << a[0] << '\n';
        return;
    }
    
    vector<array<ll, 2>> dp(n);
    auto dfs = [&](auto&& self, int u, int fa) -> void {
        if (u && e[u].size() == 1) {
            return;
        }
        ll sum0 = 0;
        int maxv = 0;
        vector<int> who;
        for (int v: e[u]) {
            if (v == fa) {
                continue;
            }
            self(self, v, u);
            sum0 += dp[v][0];
            chmax(maxv, a[v]);
            who.push_back(v);
        }
        dp[u][0] = sum0 + maxv;
        dp[u][1] = sum0;
        sort(all(who), 
            [&](int x, int y) {
                return dp[x][1] + a[x] > dp[y][1] + a[y];
            });
        for (int v: e[u]) {
            if (v == fa) {
                continue;
            }
            if (t[v] == 3) {
                ll res = 0;
                if (v == who[0]) {
                    if (who.size() == 1) {
                        continue;
                    }
                    res = sum0 - dp[who[1]][0] + dp[who[1]][1] + a[who[1]] + a[v];
                } else {
                    res = sum0 - dp[who[0]][0] + dp[who[0]][1] + a[who[0]] + a[v];
                }
                chmax(dp[u][0], res);
            }
        }
    };
    dfs(dfs, 0, -1);
    
    cout << dp[0][0] + a[0] << '\n';
}

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	
	int t = 1; 
	cin >> t;
	while(t --) {
	    solve();
	}

	return 0;
}