H - Crystalfly

// Problem: H. Crystalfly
// Contest: Codeforces - The 2021 ICPC Asia Nanjing Regional Contest (XXII Open Cup, Grand Prix of Nanjing)
// URL: https://codeforces.com/gym/103470/problem/H
// Memory Limit: 256 MB
// Time Limit: 2000 ms
// 2022-03-02 10:30:03
// 
// Powered by CP Editor (https://cpeditor.org)

#include<bits/stdc++.h>
using namespace std;

#define rep(i,l,r) for(int i=(l);i<=(r);i++)
#define per(i,l,r) for(int i=(l);i>=(r);i--)
#define ll long long
#define pii pair<int, int>
#define mset(s,t) memset(s,t,sizeof(t))
#define mcpy(s,t) memcpy(s,t,sizeof(t))
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define SZ(x) ((int)(x).size())
#define mp make_pair

const ll mod = 1e9 + 7;

inline ll qmi (ll a, ll b) {
	ll ans = 1;
	while (b) {
		if (b & 1) ans = ans * a%mod;
		a = a * a %mod;
		b >>= 1;
	}
	return ans;
}
inline int read () {
	int x = 0, f = 0;
	char ch = getchar();
	while (!isdigit(ch)) f |= (ch=='-'),ch= getchar();
	while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
	return f?-x:x;
}
template<typename T> void print(T x) {
	if (x < 0) putchar('-'), x = -x;
	if (x >= 10) print(x/10);
	putchar(x % 10 + '0');
}
inline ll sub (ll a, ll b) {
	return ((a - b ) %mod + mod) %mod;
}
inline ll add (ll a, ll b) {
	return (a + b) %mod;
}
inline ll inv (ll a) {
	return qmi(a, mod - 2);
}
#define int long long
const int N =  1e5 + 10;
const int INF = (1 << 30);
int n, m;	
int t[N], a[N];
int f[N];
vector<int> edges[N];
int sum[N];
void dfs (int u, int fa) {
	multiset<int> s;
	int mx = 0;
	for (auto v : edges[u]) {
		if (v == fa) continue;
		dfs(v, u);
		sum[u] += f[v];
		mx = max (mx, a[v]);
		if (t[v] == 3) s.insert(a[v]);
	}
	s.insert(-0x3f3f3f3f3f3f3f3f);
	f[u] = max(f[u], sum[u] + mx);
	for (auto v : edges[u]) {
		if (v == fa) continue;
		if (t[v] == 3) 
		{s.erase(s.find(a[v]));}
		f[u] = max (f[u], sum[u] - f[v] + a[v] + sum[v] + *s.rbegin());
		if (t[v] == 3) s.insert(a[v]);
	}
}
void solve() {
	
	cin >> n;
	rep(i, 1, n) {
		a[i] = read();
		edges[i].clear();
		f[i] = 0;
		sum[i] = 0;
	}
	
	rep(i, 1, n) cin >> t[i];
	for (int i =1 ; i<= n - 1; i ++) {
		int a,b;
		a = read();
		b =read();
		edges[a].pb(b);
		edges[b].pb(a);
	}
	dfs(1, 0);	
	print(f[1] + a[1]);
	puts("");
}
signed main () {
    int t;
    t =1;
    cin >> t;
    while (t --) solve();
    return 0;
}

f[u]表示到达u之前的最大价值 sum[u] = f[v] + f[v1] + ... 有两种选择，一个只选择一个进去 f[u] = max (a[v]) + sum[u]; 选择多个 f[u] = max (f[u], sum[u] - f[v] + a[v] + *st.rbegin() + sum[v]); 选择合适的描述方法