#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
const int N = 200010;

bool st[N];
int pr[N],cnt;
struct point
{
	int x,y,op;
}p[N];

bool cmp(point x,point y)
{
	return x.x > y.x;
}
map<int,int> mp;

void solve()
{
	int h;cin >> h;
	mp.clear();
	int n;cin >> n;
	for(int i = 1;i <= n;i++)
	{
		cin >> p[i].x >> p[i].y;
		p[i].op = 1;
	}
	int m;cin >> m;
	for(int i = 1;i <= m;i++)
	{
		cin >> p[i + n].x >> p[i + n].y;
		p[i + n].op = 2;
	}
	sort(p + 1,p + 1 + n + m, cmp);
	for(int i = 1;i <= n + m;i++)
	{
		int t = p[i].op;
		int x = p[i].x,y = p[i].y;
		// cout << x << endl;
		if(t == 2)
		{
			mp[(x + y) % (2 * h)]++;
			// cout << (x - y) % (2 * h) <<" " << ((2 * h - x - y) % (2 * h) + 2 * h) % (2 * h) << endl;
			// cout << x <<"  <<  y << endl;
			mp[((2 * h + x - y) % (2 * h) + 2 * h) % (2 * h)]++;
		}
		else 
		{
			int mx = max(mp[(x + y) % (2 * h)],mp[((2 * h + x - y) % (2 * h) + 2 * h) % (2 * h)]);
			mp[(x + y) % (2 * h)] = mx;
			mp[((2 * h + x - y) % (2 * h) + 2 * h) % (2 * h)] = mx;
		}
	}
	cout << mp[0] << endl;
	

}
signed main()
{
	ios::sync_with_stdio(false);cin.tie(0);
	int T;cin >> T;
	while(T--)solve();
}