#include<bits/stdc++.h>
//#define int long long
#define endl "\n"
#define ll long long
#define PII std::pair<int,int>
using namespace std;
const int maxn = 1e5 + 5;
vector<int> w(maxn), t(maxn), sum(maxn);
vector<vector<int>> G(maxn);
int dp[maxn];
void dfs(int u, int fa) {
    int m1 = 0, m2 = 0, m3 = 0;
    bool f = false;
    for (auto v : G[u]) {
        if (v == fa) continue;
        dfs(v, u);
        sum[u] += dp[v];
        if (w[m1] < w[v]) m1 = v;
        if (t[v] == 3) {
            f = true;
            if (w[v] > w[m2]) m2 = v;
            else if (w[v] > w[m3]) m3 = v;
        }
    }
    dp[u] = max(dp[u], sum[u] + w[m1]);
    if (f && m1 != m2) dp[u] = max(dp[u], w[m1] + w[m2] + sum[u] - dp[m1] + sum[m1]);
    if (f && m1 == m2 && m3) dp[u] = max(dp[u], w[m1] + w[m3] + sum[u] - dp[m1] + sum[m1]);
}
int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(0);
    int T; cin >> T;
    while (T--) {
        memset(dp, 0, sizeof(dp));
        int n; cin >> n;
        for (int i = 1; i <= n; ++i) G[i].clear();
        for (int i = 1; i <= n; ++i) sum[i] = 0;
        for (int i = 1; i <= n; ++i) cin >> w[i];
        for (int i = 1; i <= n; ++i) cin >> t[i];
        for (int i = 1; i <= n - 1; ++i) {
            int a, b; cin >> a >> b;
            G[a].push_back(b);
            G[b].push_back(a);
        }
        dfs(1, 0);
        cout << dp[1] + w[1] << endl;
    }
    return 0;
}