#include<bits/stdc++.h>
#define N 100005
#define int long long
#define inf 2000000000000000000ll
using namespace std;
int read()
{
	int x=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
	return x*f;
}
int t,n,m,k,d,a[N],c[N],sum,ans;
queue<int> q;
bool solve(int x)
{
	while(q.size())q.pop();
	if(x==0)return 0;int tot=0;
	for(int i=1;i<=x;i++)
	{
		q.push(1);
		tot+=c[m-i+1];
	}
	for(int i=1;i<=k;i++)
	{
		if(a[i]-q.front()>d)return 0;
		q.push(a[i]);q.pop();
	}
	while(q.size())
	{
		if(n-q.front()>d)return 0;
		q.pop();
	}
	ans=min(ans,sum-tot);
	return 1;
}
signed main()
{
	t=read();
	while(t--)
	{
		n=read();m=read();sum=0;
		k=read();d=read();ans=inf;
		for(int i=1;i<=m;i++)c[i]=read(),sum+=c[i];
		for(int i=1;i<=k;i++)a[i]=read();
		sort(c+1,c+1+m);sort(a+1,a+1+k);
		if(d>n-1)
		{
			cout<<"0\n";
			continue;
		}
		a[0]=1;a[k+1]=n;int num=0; 
		for(int i=1;i<=k+1;i++)
		{
			if(a[i]-a[i-1]>d)
			num++;
		}
		if(num)ans=sum-c[1]+c[1]*num;
		else ans=sum-c[m];
		int l=1,r=m,mid;
		while(l<=r)
		{
			mid=(l+r)>>1;
			if(solve(mid))l=mid+1;
			else r=mid-1;
		}
		cout<<ans<<"\n"; 
	}
	return 0;
}