#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
inline int read(){
	int x=0,k=1;char c=getchar();
	while(c<'0'||c>'9'){
		if(c=='-')k=-1;
		c=getchar();
	}
	while(c>='0'&&c<='9')x=(x<<3)+(x<<1)+(c^48),c=getchar();
	return x*k;
}
map<int,vector<int>>a,b;
map<int,map<int,int>>f;
int h;
int dfs(int k,int x){
	if(f.count(k)&&f[k].count(x))return f[k][x];
	int c=a[k].end()-upper_bound(a[k].begin(),a[k].end(),x);
	f[k][x]=c;
//	cout<<k<<' '<<x<<' '<<c<<endl;
	for(auto it:b[k]){
		if(it<=x)continue;
		int cc=a[k].end()-upper_bound(a[k].begin(),a[k].end(),it);
		int kk=k;
		int y=(it-k)%(2*h);
		if(y>h)y=2*h-y;
		if((it-k)%(2*h)>h){
			kk=(it%(2*h)+2*h-y)%(2*h);
		}
		else kk=(it%(2*h)+y)%(2*h);
		int m=dfs(kk,it);
		f[k][x]=max(f[k][x],f[kk][it]+c-cc);
	}
	return f[k][x];
}
void sol(){
	h=read();
	int n=read();
	a.clear(),b.clear(),f.clear();
	for(int i=1;i<=n;++i){
		int x=read(),y=read();
		b[(x%(2*h)+y)%(2*h)].push_back(x);
		if((x%(2*h)+y)%(2*h)!=(x%(2*h)+2*h-y)%(2*h))b[(x%(2*h)+2*h-y)%(2*h)].push_back(x);
	}
	int m=read();
	for(int i=1;i<=m;++i){
		int x=read(),y=read();
		a[(x%(2*h)+y)%(2*h)].push_back(x);
		if((x%(2*h)+y)%(2*h)!=(x%(2*h)+2*h-y)%(2*h))a[(x%(2*h)+2*h-y)%(2*h)].push_back(x);
	}
	for(auto &it:a)sort(it.second.begin(),it.second.end());
	for(auto &it:b)sort(it.second.begin(),it.second.end());
	int ans=0;
	dfs(0,0);
	cout<<f[0][0]<<endl;
}
signed main(){
//	freopen("1.in","r",stdin);
//	freopen("1.out","w",stdout);
	int T=read();
	while(T--)sol();
}