// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/

#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<pii,int>
#define mpp make_pair
#define fi first
#define se second
const int inf=1e18;
const int mod=998244353;
const int maxn=2005;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=1000005;
const int maxl=20;
const int maxa=1000000;
const int root=3;
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
const int iroot=power(3,mod-2);
const int base=101;

int n,a[maxn],t[maxn],sz[maxn];
int dp[maxn][maxn][2];
vector<int> edge[maxn];

int cur[maxn][2],tmp[maxn],G[maxn];

void dfs(int u,int p){
    int sum=0;sz[u]=0;
    for(int v:edge[u]){
        if(v==p) continue;
        dfs(v,u);sum+=sz[v];
    }
    if(!sum){
        sz[u]=1;
        dp[u][1][1]=0;
        dp[u][1][0]=0;
        dp[u][0][1]=0;
        dp[u][0][0]=a[u];
        return;
    }
    for(int i=0;i<=sum;i++) dp[u][i][0]=dp[u][i][1]=G[i]=inf;
    dp[u][0][0]=dp[u][0][1]=G[0]=0;

    for(int v:edge[u]){
        if(v==p) continue;
        for(int i=0;i<=sz[u]+sz[v];i++) cur[i][0]=cur[i][1]=tmp[i]=inf;
        for(int i=0;i<=sz[u];i++) for(int j=0;j<=sz[v];j++){
            for(int a=0;a<=1;a++) for(int b=0;b<=1-a;b++) cur[i+j][a+b]=min(cur[i+j][a+b],dp[u][i][a]+dp[v][j][b]);
            tmp[i+j]=min(tmp[i+j],G[i]+dp[v][j][1]);
        }
        sz[u]+=sz[v];
        for(int i=0;i<=sz[u];i++){
            G[i]=tmp[i];
            dp[u][i][0]=cur[i][0];
            dp[u][i][1]=cur[i][1];
        }
    }
    for(int i=0;i<=sz[u];i++){
        dp[u][i][0]=min(dp[u][i][0],G[i]+a[u]);
        dp[u][i][1]=min(dp[u][i][1],dp[u][i][0]);
    }
}

void solve(){
    cin >> n;
    for(int i=1;i<=n;i++) edge[i].clear();
    for(int i=1;i<=n;i++) cin >> a[i];
    for(int i=1;i<=n;i++) cin >> t[i];
    for(int i=1;i<n;i++){
        int u,v;cin >> u >> v;
        edge[u].push_back(v);
        edge[v].push_back(u);
    }
    dfs(1,0);
    int ans=inf;
    for(int i=0;i<=sz[1];i++) ans=min(ans,dp[1][i][1]+t[i]);
    cout << ans << '\n';
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;cin >> test;
    while(test--) solve();
}