#include <cstdint>
#define GCC optimize(3)
#include <bits/stdc++.h>
using namespace std;

using i64 = int64_t;
using i128 = __int128;

#define IOS ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define endl '\n'

#ifdef FILE_CHECK
    ifstream fin("./data.in");
    ofstream fout("./data.out");
    #define cin fin
    #define cout fout
#endif

void solve() {
    int n;
    cin >> n;
    vector<i64> a(n+1,0), t(n+1,0);
    for (int i = 1; i <= n; ++i) cin >> a[i];
    for (int i = 1; i <= n; ++i) cin >> t[i];

    vector<vector<int>> edges(n+1);
    for (int i = 1; i <= n-1; ++i) {
        int from, to;
        cin >> from >> to;
        edges[from].push_back(to);
        edges[to].push_back(from);
    }

    vector<i64> dis(n+1,0), sum(n+1,0);

    function<void(int,int)> dfs = [&](int cur, int fa) -> void {
        if (edges[cur].size() == 1ull && edges[cur][0] == fa) {
            dis[cur] = a[cur];
            return;
        }

        int mx{}, temp{};
        for (auto&& to : edges[cur]) {
            if (to == fa) continue;

            if (a[to] >= temp) {
                temp = a[to];
                mx = to;
            }

            dfs(to, cur);
            sum[cur] += dis[to] - a[to];
        }

        // case 1
        int v1{}, u1{}, v2{}, u2{};
        i64 temp1{}, temp2{INT64_MAX};
        for (auto&& to : edges[cur]) {
            if (to == fa) continue;
            if (t[to] == 3 && a[to] >= temp1) {
                temp1 = a[to];
                v1 = to;
            }
            // dis[to] -> a[to] + sum[to]
            if (temp2 >= a[to] + sum[to] - dis[to]) {
                temp2 = a[to] + sum[to] - dis[to];
                u2 = to;
            }
        }

        temp1 = 0, temp2 = INT64_MAX;
        for (auto&& to : edges[cur]) {
            if (to == fa) continue;
            if (t[to] == 3 && a[to] >= temp1 && u2 != to) {
                temp1 = a[to];
                v2 = to;
            }
            // dis[to] -> a[to] + sum[to]
            if (temp2 >= a[to] + sum[to] - dis[to] && v1 != to) {
                temp2 = a[to] + sum[to] - dis[to];
                u1 = to;
            }
        }
        
        dis[cur] = max(dis[cur], sum[cur] + a[mx]);
        dis[cur] = max(dis[cur], sum[cur] + 2 * a[u1] - dis[u1] + sum[u1] + a[v1]);
        dis[cur] = max(dis[cur], sum[cur] + 2 * a[u2] - dis[u2] + sum[u2] + a[v2]);
        
        dis[cur] += a[cur];
    };
    dfs(1, 0);

    cout << dis[1] << endl;
    
}

signed main() {
    IOS;
    int t{1};
    cin >> t;
    while (t--) {
        solve();
    }

    #ifdef FILE_CHECK
        fin.close();
        fout.close();
    #endif
}