#include <bits/stdc++.h>
#define ll long long
#define LL long long
#define ls p<<1
#define rs p<<1|1
#define Ma 1000005
#define mod 1000000007
#define PLL pair<ll,ll>
#define PDD pair<double,double>
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define fi first
#define se second
#define N 205
#define pb push_back
#define ld long double
#define all(x) x.begin(),x.end()
#define inf 1e18

using namespace std;
ll n,m;
ll a[Ma],c[Ma],v[Ma];
ll dp[N][N];


void clc()
{
	for (ll i=0;i<=n;i++)
		for (ll j=0;j<=n;j++)
			dp[i][j]=-inf;
	dp[0][0]=0;
}

void sol()
{
	cin>>n>>m;
	n<<=1;
	clc();
	for (ll i=1;i<=m;i++)
		cin>>a[i];
	
	for (ll i=1;i<=n;i++)
		cin>>c[i];
	for (ll i=1;i<=n;i++)
		cin>>v[i];
	for (ll i=1;i<=n;i++)
		for (ll j=(i+1)/2;j<=min(n,i);j++)
		{
			if (j>m||c[i]>=a[j])
				dp[i][j]=max(dp[i-1][j],dp[i-1][j-1]+v[i]);
			else
				dp[i][j]=dp[i-1][j];
			//printf("i=%lld j=%lld dp=%lld\n",i,j,dp[i][j]);
		}
	ll ans=dp[n][n/2];
	if (ans<0)
		printf("-1\n");
	else
		printf("%lld\n",ans);
	return;
}

int main()
{
	IOS
	ll tt=1;
	cin>>tt;
	while (tt--)
		sol();
	return 0;
}