#include <bits/stdc++.h>
using namespace std;
struct AAA {
	int x, y, t;
} a[400005];
int dp[400005][2];
map<int, int> M1, M2;
int ncnt, H;
struct Node {
	int ls, rs, mx;
} t[13000005];
void add(int &p, int l, int r, int x, int y) {
	if (!p) {
		p = ++ncnt;
		t[p].ls = t[p].rs = 0;
		t[p].mx = -1e9;
	}
	t[p].mx = max(t[p].mx, y);
	if (l == r) return;
	int mid = l + (r - l) / 2;
	if (x <= mid) add(t[p].ls, l, mid, x, y);
	else add(t[p].rs, mid + 1, r, x, y);
}
int ask(int p, int l, int r, int x) {
	if (!p || l > x) return -1e9;
	if (r <= x) return t[p].mx;
	int mid = l + (r - l) / 2;
	return max(ask(t[p].ls, l, mid, x), ask(t[p].rs, mid + 1, r, x));
}
void ins(int i) {
//	printf("M1:mod<%d> %d %d\n", (a[i].x - a[i].y + H) % H, a[i].x - a[i].y, dp[i][0]);
//	printf("M2:mod<%d> %d %d\n", (a[i].x + a[i].y) % H, a[i].x + a[i].y, dp[i][1]);
	add(M1[(a[i].x - a[i].y + H) % H], -1e9, 1e9, a[i].x - a[i].y, dp[i][0]);
	add(M2[(a[i].x + a[i].y) % H], 0, 2e9, a[i].x + a[i].y, dp[i][1]);
}
int main() {
	int T;
	cin >> T;
	while (T--) {
		M1.clear();
		M2.clear();
		ncnt = 0;
		int n, m;
		scanf("%d", &H);
		H+=H;
		scanf("%d", &n);
		for (int i = 1; i <= n; ++i) {
			int x, y;
			scanf("%d%d", &x, &y);
			a[i] = (AAA){x, y, 0};
		}
		scanf("%d", &m);
		for (int i = 1; i <= m; ++i) {
			int x, y;
			scanf("%d%d", &x, &y);
			a[i + n] = (AAA){x, y, 1};
		}
		sort(a + 1, a + n + m + 1, [](const AAA &a, const AAA &b) { return a.x < b.x; });
		ins(0);
		int ans = 0;
		for (int i = 1; i <= n + m; ++i) {
			dp[i][1] = a[i].t + max(ask(M1[(a[i].x + a[i].y) % H], -1e9, 1e9, a[i].x + a[i].y),
							ask(M2[(a[i].x + a[i].y) % H], 0, 2e9, a[i].x + a[i].y));
			dp[i][0] = a[i].t + max(ask(M1[(a[i].x - a[i].y + H) % H], -1e9, 1e9, a[i].x - a[i].y),
							ask(M2[(a[i].x - a[i].y + H) % H], 0, 2e9, a[i].x - a[i].y));
			ans = max(ans, dp[i][1]);
			ans = max(ans, dp[i][0]);
			if (!a[i].t) dp[i][0] = dp[i][1] = max(dp[i][0], dp[i][1]);
			ins(i);
		}
		printf("%d\n", ans);
	}
	return 0;
}