#include<bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
typedef long long ll;
#define re read()
#define INF 9223372036854775800
#define fr(i, x, y) for(int i = x, p = y; i <= p; ++i) 
#define rp(i, x, y) for(int i = x, p = y; i >= p; --i)
#define Timeok ((double)clock() / CLOCKS_PER_SEC < MAX_TIME)
const double MAX_TIME = 1.0 - 0.0032;

inline ll read()
{
   ll x = 0, f = 0;
   char ch = getchar();
   while (!isdigit(ch))
      f |= (ch == '-'), ch = getchar();
   while (isdigit(ch))
      x = (x << 1) + (x << 3) + (ch ^= 48), ch = getchar();
   return f ? -x : x;
}

void write(ll x)
{
   if (x < 0)
      putchar('-'), x = -x;
   if (x > 9)
      write(x / 10);
   putchar(x % 10 + 48);
}

inline void W(ll x, char ch)
{
    write(x);
    putchar(ch);
}

/*------------C-O-D-E------------*/

const int N = 5e5 + 4;
ll n, m, T;

struct node
{
    ll nxt, to;
} t[N];

ll a[N], k[N];

ll head[N], tot;
ll f[N], fson[N];


void add(ll u, ll v)
{
    t[++tot].nxt = head[u];
    t[tot].to = v;
    head[u] = tot;
}

void C()
{
    fr(i,1,2*n+3) t[i]={0,0},head[i]=0;
    tot=0;
    fr(i,1,2*n+3) f[i] = 0, fson[i] = 0;
    fr(i,1,n+3) a[i]=0,k[i] =0;
}

void dfs(ll now, ll fa)
{
    for(int i = head[now]; i;i = t[i].nxt)
    {
        ll y = t[i].to;
        if(y == fa) continue;
        dfs(y, now);
    }

    ///////
    ll maxn3 = 0, maxson = 0; 
    for(int i = head[now]; i;i = t[i].nxt)
    {
        ll y = t[i].to;
        if(y == fa) continue;
        if(k[y] == 3)
        {
            maxn3 = max(maxn3, a[y]);
        }
        maxson = max(maxson, a[y]);
    }

    if(maxn3 == 0)
    {
        ll sum = maxson;
        for(int i = head[now]; i; i = t[i].nxt)
        {
            ll y = t[i].to;
            if(y == fa) continue;
            sum += f[y];
        }
        f[now] = sum;
        fson[now] = sum - maxson;

        // W(now, ' '); W(f[now], '\n');
    }
    else
    {
        ll sum = maxson;
        for(int i = head[now]; i; i = t[i].nxt)
        {
            ll y = t[i].to;
            if(y == fa) continue;
            sum += f[y];
        }
        f[now] = sum;
        fson[now] = sum - maxson;

        ////////
        sum = 0;
        for(int i = head[now]; i;i = t[i].nxt)
        {
            ll y = t[i].to;
            if(y == fa) continue;
            sum += f[y];
        }
        bool okmaxn3 = 0;
        ll cha = 0, _a = 0;
        // sum += maxn3;
        for(int i = head[now]; i;i = t[i].nxt)
        {
            ll y = t[i].to;
            if(y == fa) continue;
            if(a[y] == maxn3 && okmaxn3 == 0)
            {
                okmaxn3 = 1;
                sum += a[y];
            }
            else
            {
                // cha = max(cha, a[y] - (f[y] - fson[y]));
                // if(a[y] - (f[y] - fson[y]) < 0) continue;
                ll nownow = a[y] - (f[y] - fson[y]);
                if(k[y] == 3) nownow = a[y];
                if(cha < nownow)
                {
                    cha = nownow;
                    _a = a[y];
                }
                // W(cha,'\n');
            }
        }
        // if(cha == -1) cha = 0;
        sum += cha;
            // puts("233");

        if(f[now] < sum)
        {
            f[now] = sum;
            fson[now] = f[now] - maxn3 - _a;
        }
    }
}

void solve()
{
    n = re;
    fr(i,1,n) a[i] = re;
    fr(i,1,n) k[i] = re;
    fr(i,1,n-1)
    {
        ll x = re, y = re;
        add(x,y);
        add(y,x);
    }

    dfs(1, 0);
    W(f[1] + a[1], '\n');

    C();
    return;
}


int main()
{
    ll T = re;
    while(T--)
    {
        solve();
    }
    
    return 0;
}