#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;
}
void sol(){
	int h=read();
	int n=read();
	map<int,vector<int>>a,b;
	for(int i=1;i<=n;++i){
		int x=read(),y=read();
		b[(x%(2*h)+y)%(2*h)].push_back(x);
		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);
		a[(x%(2*h)+2*h-y)%(2*h)].push_back(x);
	}
	int ans=0; 
	queue<pair<int,int>>q;
	q.push({0,0});
	map<int,map<int,int>>f;
	set<pair<int,int>>se;
	se.insert({0,0});
	while(!q.empty()){
		int k=q.front().first,x=q.front().second;
		q.pop();
		se.erase({k,x});
		int c=a[k].end()-lower_bound(a[k].begin(),a[k].end(),x);
		ans=max(ans,f[k][x]+c);
		for(auto it:b[k]){
			if(it<=x)continue;
			int cc=a[k].end()-lower_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);
			if(!f.count(kk)||f[kk].count(it)||f[kk][it]>f[k][x]+c-cc){
				f[kk][it]=f[k][x]+c-cc;
				if(se.count({kk,it}))continue;
				se.insert({kk,it});
				q.push({kk,it});
			}
		}
	}
	cout<<ans<<endl;
}
signed main(){
	int T=read();
	while(T--)sol();
}