#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

const int INF = 1'000'000'007;
const int N = 1 << 11;

int n;
int a[N], t[N];
VI g[N];

void read()
{
	cin >> n;
	FOR(i, 0, n)
		cin >> a[i];
	FOR(i, 1, n + 1)
		cin >> t[i];
	FOR(i, 0, n - 1)
	{
		int u, v;
		cin >> u >> v;
		u--;
		v--;
		g[u].PB(v);
		g[v].PB(u);
	}
}

void updMin(int& x, int val)
{
	x = min(x, val);
}

vector<VI> dfs(int v, int p)
{
	bool isLeaf = true;
	VI dp1 = {0};
	vector<VI> dp2 = {{0}, {0}};
	for (int to : g[v])
	{
		if (to == p)
			continue;
		isLeaf = false;
		auto dpTo = dfs(to, v);
		assert(SZ(dpTo[0]) == SZ(dpTo[1]));
		int nsz = SZ(dp1) + SZ(dpTo[0]) - 1;
		VI ndp1(nsz, INF);
		vector ndp2(2, VI(nsz, INF));
		FOR(c1, 0, SZ(dp1))
		{
			FOR(c2, 0, SZ(dpTo[0]))
			{
				updMin(ndp1[c1 + c2], dp1[c1] + dpTo[1][c2]);
				FOR(i, 0, 2)
				{
					FOR(j, 0, 2 - i)
					{
						updMin(ndp2[i + j][c1 + c2], dp2[i][c1] + dpTo[j][c2]);
					}
				}
			}
		}
		dp1 = ndp1;
		dp2 = ndp2;
		assert(SZ(dp1) == SZ(dp2[0]) && SZ(dp1) == SZ(dp2[1]));
	}
	if (isLeaf)
	{
		return {{a[v], 0}, {0, 0}};
	}
	vector dp(2, VI(SZ(dp1)));
	FOR(c, 0, SZ(dp1))
	{
		dp[0][c] = min(dp2[0][c], a[v] + dp1[c]);
		dp[1][c] = min(dp2[1][c], dp[0][c]);
	}
	return dp;
}

void solve()
{
	auto res = dfs(0, -1)[1];
	int ans = INF;
	FOR(i, 0, SZ(res))
	{
		ans = min(ans, res[i] + t[i]);
	}
	cout << ans << "\n";
}

void clear()
{
	FOR(i, 0, n)
		g[i].clear();
}

int main()
{
	ios::sync_with_stdio(0); 
	cin.tie(0);
	cout << fixed << setprecision(15);
	int tc;
	cin >> tc;
	while (tc--)
	{
		read();
		solve();
		clear();
	}
	return 0;
}