#include<bits/stdc++.h>
#define debug(x) cerr<<#x<<":"<<x<<"\n"
using namespace std;
using ll = long long;
using pii = pair <int,int>;
const int N = 1e5 + 5, MOD = 1e9 + 7;
int n, t[N];
ll ans, a[N], f[N], df[N];
vector <vector<int>> e(N);
void dfs(int u,int fa)
{
    f[u] = a[u];df[u] = a[u];
    int m1 = 0, m2 = 0;
    ll sum = 0;
    for(auto son:e[u])
    {
        if(son!=fa)
        {
            dfs(son,u);
            if(df[son] >= df[m1]) {
                m2 = m1;
                m1 = son;
            } 
            else if(df[son] > df[m2]) {
                m2 = son;
            }
            sum += f[son] - a[son];
            df[u] += f[son] - a[son];
        }
    }
    ll res = 0;
    for (auto son : e[u]) {
        if(son != fa) {
            if(t[son] == 3) {
                if(son == m1) {
                    res = std::max(res, f[son] + df[m2] + sum - (f[m2] - a[m2]) - (f[son] - a[son]));
                }
                else {
                    res = std::max(res, f[son] + df[m1] + sum - (f[m1] - a[m1]) - (f[son] - a[son]));
                }
                res = std::max(res, f[son] + sum - (f[son] - a[son]));
            }
            else {
                res = std::max(res, f[son] + sum - (f[son] - a[son]));
            }
        }
    }
    f[u] += res;
}
void solve()
{
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
        f[i] = 0;
        e[i].clear();
    }
    for(int i=1;i<=n;i++) cin>>t[i];
    for(int i=1,u,v;i<n;i++)
    {
        cin>>u>>v;
        e[u].emplace_back(v);
        e[v].emplace_back(u);
    }
    ans = 0;
    dfs(1,0);
    cout<<f[1]<<'\n';
}
int main(void)
{
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    int T = 1;
    cin >> T;
    while(T--) solve();
    return 0;
}