#include<bits/stdc++.h>

#ifndef ONLINE_JUDGE
#include "debug.h"
#else
#define debug(...) 42
#endif

using i64 = long long;

namespace ranges = std::ranges;

//ti = 3, 可以多选一个旁支
//ti < 3, 只能选一条路

void solve()
{
#define tests
    int n; std::cin >> n; std::vector<int> a(n); std::vector<int> t(n); for (auto& ai : a) {std::cin >> ai;} for (auto& ti : t) {std::cin >> ti;}
    std::vector adj(n, std::vector<int>()); for (int i = 0, u, v; i + 1 < n; i++) {std::cin >> u >> v; --u; --v; adj[u].push_back(v); adj[v].push_back(u);}

    std::vector<i64> dp(n);     
    auto dfs = [&](auto self, int now, int fa) -> void {
        std::set<std::pair<int, int>> S; for (auto& to : adj[now]) if (to != fa) {S.emplace(a[to], to);}
        auto get_max_except = [&](int id) {auto it{S.rbegin()}; if (it->second == id) {it++;} return it->first;};
        for (auto& to : adj[now]) if (to != fa) {
            self(self, to, now);
            if (t[to] < 3) {
                dp[now] = std::max(dp[now], dp[to] + a[to]);
                dp[now] = std::max(dp[now], dp[to] + get_max_except(to));
            } else {
                dp[now] = std::max(dp[now], dp[to] + a[to] + get_max_except(to));
            }  
        }
    };
    dfs(dfs, 0, -1);
    std::cout << dp[0] + a[0] << "\n";
}

signed main()
{
   std::cin.tie(nullptr)->sync_with_stdio(false);
   int _(1);
#ifdef tests
   std::cin >> _;
#endif
   while(_--) solve();
   return 0;
}