#include "bits/stdc++.h"

using namespace std;

using ll = long long;
using ull = unsigned long long;

#define IOS ios::sync_with_stdio(0);cin.tie(0);
#define endl "\n"
#define yes cout<<"YES"<<endl;
#define no cout<<"NO"<<endl;
#define lowbit(x) x&(-x)

void solve() {
    int n;
    cin >> n;
    vector<ll> ans(n + 10);
    vector<ll> dp(n + 10);
    vector<int> time(n + 10);
    vector<vector<int>> mp(n + 10);
    for (int i = 1; i <= n; i++) {
        cin >> ans[i];
    }
    for (int i = 1; i <= n; i++) {
        cin >> time[i];
    }
    for (int i = 1; i < n; i++) {
        int x, y;
        cin >> x >> y;
        mp[x].emplace_back(y);
        mp[y].emplace_back(x);
    }
    function<void(int, int)> dfs = [&](int len, int f) {
        multiset<int> s;
        for (auto i: mp[len]) {
            if (i == f)continue;
            s.insert(ans[i]);
            dfs(i, len);
        }
        ll maxs = ans[len];
        for (auto i: mp[len]) {
            if (i == f)continue;
            if (time[i] < 3) {
                maxs = max(maxs, ans[len] + dp[i] - ans[i] + *(--s.end()));
            } else {
                if (s.size() > 1) {
                    int t = ans[i];
                    auto it = s.find(t);
                    s.erase(it);
                    maxs = max(maxs, ans[len] + dp[i] + *(--s.end()));
                    s.insert(t);
                } else {
                    maxs = max(maxs, ans[len] + dp[i] - ans[i] + *(--s.end()));
                }
            }
        }
        dp[len] = maxs;
    };
    dfs(1, -1);
    cout << dp[1] << endl;
}
//2
//5
//1 10 100 1000 10000
//1 2 1 1 1
//1 2
//1 3
//2 4
//2 5
//5
//1 10 100 1000 10000
//1 3 1 1 1
//1 2
//1 3
//2 4
//2 5


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