#include<bits/stdc++.h>
using namespace std;
#define V vector
#define pb push_back
typedef pair<int, int> pi;
typedef long long LL;

const int INF = 2e9 + 100;
const LL INFLL = 8e18 + 100;
void solve() {
    int n; cin >> n;
    V<int> a(n + 1);
    V<V<int>> e(n + 1);
    for(int i = 1; i <= n; i++) cin >> a[i];

    V<LL> dp(n + 1);
    V<int> t(n + 1);
    for(int i = 1; i <= n; i++) cin >> t[i];

    for(int i = 1; i < n; i++) {
        int a, b; cin >> a >> b;
        e[a].pb(b), e[b].pb(a);
    }

    auto dfs = [&](int x, int p, auto dfs) -> void {
        LL now = 0;
        LL mx = -INFLL, mx2 = -INFLL;
        for(auto y : e[x]) {
            if(y == p) continue;
            dfs(y, x, dfs);
            now += dp[y];
            LL cur = a[y] - dp[y];
            if(cur > mx) {
                mx2 = mx, mx = cur;
            } else if(cur > mx2) mx2 = cur;
        }

        LL mx_son = 0;
        for(auto y : e[x]) {
            if(y == p) continue;
            LL cur = a[y] - dp[y];
            if(t[y] == 3) {
                if(mx == cur) mx_son = max(mx_son, a[y] + mx2);
                else mx_son = max(mx_son, a[y] + mx);
            }
            mx_son = max(mx_son, (LL)a[y]);
        }
        dp[x] = mx_son + now;
    };

    dfs(1, 0, dfs);
    cout << dp[1] + a[1] << endl;

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