//Crimson flames tied through my ears
//Rollin' high and mighty traps
//Pounced with fire on flaming roads
//Using ideas as my maps
//"We'll meet on edges, soon," said I
//Proud 'neath heated brow
//Ah, but I was so much older then
//I'm younger than that now.
//
//Half-cracked prejudice leaped forth
//"Rip down all hate," I screamed
//Lies that life is black and white
//Spoke from my skull, I dreamed
//Romantic facts of musketeers
//Foundationed deep, somehow
//Ah, but I was so much older then
//I'm younger than that now.
//
//Girls' faces formed the forward path
//From phony jealousy
//To memorizing politics
//Of ancient history
//Flung down by corpse evangelists
//Unthought of, thought, somehow
//Ah, but I was so much older then
//I'm younger than that now.
//A self-ordained professor's tongue
//Too serious to fool
//Spouted out that liberty
//Is just equality in school
//"Equality," I spoke the word
//As if a wedding vow
//Ah, but I was so much older then
//I'm younger than that now.
//
//In a soldier's stance, I aimed my hand
//At the mongrel dogs who teach
//Fearing not that I'd become my enemy
//In the instant that I preach
//My existence led by confusion boats
//Mutiny from stern to bow
//Ah, but I was so much older then
//I'm younger than that now.
//
//Yes, my guard stood hard when abstract threats
//Too noble to neglect
//Deceived me into thinking
//I had something to protect
//Good and bad, I define these terms
//Quite clear, no doubt, somehow
//Ah, but I was so much older then
//I'm younger than that now.

#pragma GCC optimize("O3,unroll-loops")
#include<bits/stdc++.h>
using namespace std;
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/hash_policy.hpp>
using namespace __gnu_pbds;
/*=====================================================================*/
#define ll long long
#define int ll
#define pii pair<int,int>
#define vi vector<int>
#define vii vector<pii>
#define pdd pair<double,double>
#define ull unsigned long long
#define pb push_back
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define all(s) (s).begin(),(s).end()
#define repd(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define forr(i,a,b,c) for(int i=(int)(a);i<=(int)(b);i+=(int)(c))
#define forn(i,p,n) for(int i=(int)(p);i<=(int)(n);++i)
#define ford(i,p,n) for(int i=(int)(n);i>=(int)(p);--i)
#define foreach(i,c) for(__typeof(c.begin())i=(c.begin());i!=(c).end();++i)
#define INF 0x3f3f3f3f
#define PI acos(-1)
#define modcg(x) if(x>=mod)x-=mod;
#define modcl(x) if(x<0)x+=mod;
#define lowbit(x) ((x)&(-(x)))
#define ckmax(x,y) x=max(x,y)
#define ckmin(x,y) x=min(x,y)
/*=====================================================================*/
mt19937 GeN(chrono::system_clock::now().time_since_epoch().count());
int Rand(int l,int r)
{
	uniform_int_distribution<>RAND1(l,r);
	return RAND1(GeN);
}
struct Fastmod
{
	int mod,b;
	typedef __int128 lll;
	void init(int m)
	{
		mod=m;
		b=((lll)1<<64)/mod;
	}
	int operator()(ull a)
	{
		int q=((lll)a*b)>>64,r=a-q*mod;
		modcg(r);
		return r;
	}
}MOD;
int mul(int a,int b)
{
	return MOD(a*b);
}
/*======================================================================*/
//think twice,code once
//think once,debug forever
const int MAXN=2020;
int dp[MAXN][MAXN][3],f[MAXN][3],g[MAXN][3];
int n;
int a[MAXN],t[MAXN];
vi v[MAXN];
int sz[MAXN];
void dfs(int now,int fa)
{
	forn(i,0,n)
	{
		dp[now][i][0]=dp[now][i][1]=dp[now][i][2]=1e18;
	}
	sz[now]=v[now].size()==1&&fa;
	if(sz[now]==1)
	{
		dp[now][0][0]=a[now];
		dp[now][0][1]=0;
		dp[now][1][0]=0;
		return;
	}
	dp[now][0][0]=a[now];dp[now][0][1]=0;
	for(int u:v[now])
	{
		if(u==fa)
		{
			continue;
		}
		dfs(u,now);
		forn(i,0,sz[now]+sz[u])
		{
			f[i][0]=f[i][1]=f[i][2]=1e18;
		}
		forn(i,0,sz[now])
		{
			forn(j,0,sz[u])
			{
				f[i+j][0]=min(f[i+j][0],dp[now][i][0]+min(dp[u][j][0],dp[u][j][1]));
				f[i+j][1]=min(f[i+j][1],dp[now][i][1]+dp[u][j][0]);
				f[i+j][2]=min(f[i+j][2],dp[now][i][2]+dp[u][j][0]);
				f[i+j][2]=min(f[i+j][2],dp[now][i][1]+dp[u][j][1]);
			}
		}
		sz[now]+=sz[u];
		forn(i,0,sz[now])
		{
			dp[now][i][0]=f[i][0];
			dp[now][i][1]=f[i][1];
			dp[now][i][2]=f[i][2];
		}
	}
	forn(i,0,sz[now])
	{
		dp[now][i][0]=min(dp[now][i][0],dp[now][i][1]);
		dp[now][i][1]=dp[now][i][2];
	}
}
void solve()
{
	cin>>n;
	forn(i,1,n)
	{
		cin>>a[i];
	}
	forn(i,1,n)
	{
		cin>>t[i];
		v[i].clear();
	} 
	forn(i,1,n-1)
	{
		int x,y;
		cin>>x>>y;
		v[x].pb(y);
		v[y].pb(x);
	}
	dfs(1,0);
//	forn(i,1,n)
//	{
//		forn(j,0,n)
//		{
//			if(dp[i][j][0]==1e18)
//			{
//				cout<<"x ";
//				continue; 
//			}
//			cout<<dp[i][j][0]<<" ";
//		}
//		cout<<endl;
//	}
//	cout<<endl;
//	forn(i,1,n)
//	{
//		forn(j,0,n)
//		{
//			if(dp[i][j][1]==1e18)
//			{
//				cout<<"x ";
//				continue; 
//			}
//			cout<<dp[i][j][1]<<" ";
//		}
//		cout<<endl;
//	}
//	cout<<endl;
//	cout<<sz[1]<<endl;
	int ans=1e18;
	forn(i,0,n)
	{
		ans=min(ans,min(dp[1][i][1],dp[1][i][0])+t[i]);
	}
	cout<<ans<<endl;
}
/*======================================================================*/
signed main()
{
    cin.tie(0);
    cout.tie(0);
	std::ios::sync_with_stdio(false);
//#define Hank2007
#ifdef Hank2007
	freopen("input.txt","r",stdin);
	freopen("output1.txt","w",stdout);
#endif
  	/*====================================================================*/
  	int TEST_CASE=1;
	cin>>TEST_CASE;
  	while(TEST_CASE--)
  	{
  		solve();
  	}
  	return 0;
}