#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=2e5+100; 
int H,n,m,f[N][2],cnt;
map<int,int> t0;
map<int,int> t1;
map<int,int> num0;
map<int,int> num1;
map<int,int> f0;
map<int,int> f1;
struct node
{
	int x,y,flag;
}c[N];
bool cmp(node a,node b){
	if(a.x==b.x) return a.y<b.y;
	return a.x<b.x;
}
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(0);cout.tie(0);
	int T;
	cin>>T;
	while(T--)
	{
		cin>>H;
		cin>>n;
		cnt=0;
		for(int i=1;i<=n;i++) 
		{
			int x,y;
			cin>>x>>y;
			c[++cnt].flag=0;
			c[cnt].x=x;c[cnt].y=y;	
		}
		cin>>m;
		for(int j=1;j<=m;j++)
		{
			int x,y;
			cin>>x>>y;
			c[++cnt].flag=1;
			c[cnt].x=x;c[cnt].y=y;	
		}
		sort(c+1,c+1+cnt,cmp);
		f[n+1][0]=0;
		int ans=0;
		t0[0]=n+1;
		t1[0]=n+1;
		for(int i=1;i<=cnt;i++)
		{
			int x=c[i].x%(2*H),y=c[i].y;
			if(c[i].flag==0)
			{
				if(t0[x-y])
				{
					f[i][0]=f[t0[x-y]][0]+num0[x-y];
				}
				else if(t1[x-y])
				{
					f[i][0]=f[t1[x-y]][1]+num1[x-y]+num0[x-y];
				}
				if(t1[x+y])
				{
					f[i][1]=f[t1[x+y]][1]+num1[x+y];
				}
				else if(t0[x+y-2*H])
				{
					f[i][1]=f[t0[x+y-2*H]][0]+num0[x+y-2*H]+num1[x+y];
				}
				t0[x-y]=i;
				t1[x+y]=i;
				num0[x-y]=0;
				num1[x+y]=0;
				f0[x-y]=max(f0[x-y],f[i][0]);
				f1[x+y]=max(f1[x+y],f[i][1]);
				ans=max(ans,max(f[i][0],f[i][1]));
			}
			else
			{
				num0[x-y]++;
				num1[x+y]++;
			}
		}
		for(int i=cnt;i>=1;i--)
		{
			if(c[i].flag==1) continue;
			int x=c[i].x%(2*H),y=c[i].y;
			ans=max(ans,f0[x-y]+num0[x-y]);
			ans=max(ans,f1[x-y]+num1[x-y]+num0[x-y]);
			ans=max(ans,f1[x+y]+num1[x+y]);
			ans=max(ans,f0[x+y-2*H]+num0[x+y-2*H]+num1[x+y]);
		}
		cout<<ans<<"\n";
		num0.clear();num1.clear();
		t0.clear();t1.clear();
		f0.clear();f1.clear();
	}
}
/*
1
3
1
4 2
3
1 1
6 2
9 1
*/