#include <bits/stdc++.h>
#define all(a) begin(a), end(a)
#define sz(a) (int) (a).size()
#define int long long
using namespace std;
const int N=100050;
int h,n,m,x[N],y[N];
struct coord{
    int x,y,ty;
    bool operator < (const coord &another){
        return x<another.x;
    }
    int f(int dir){
        if (dir){
            return (x-y+2*h)%(2*h);
        }else{
            return (x+y)%(2*h);
        }
    }
};
vector<coord> srt;
map<int,int> dp;
void solve() {
    cin>>h>>n;
    for (int i=0;i<n;i++){
        cin>>x[i]>>y[i];
    }
    cin>>m;
    srt.resize(n+m);
    for (int i=0;i<n;i++) srt[i]={x[i],y[i],0};
    for (int i=0;i<m;i++){
        cin>>srt[n+i].x>>srt[n+i].y;
        srt[n+i].ty=1;
    }
    sort(all(srt));
    dp.clear();
    dp[0]=1;
    for (auto i:srt){
        int to[2]={dp[i.f(0)],dp[i.f(1)]};
        if (i.ty){
            if (to[0]) to[0]++;
            if (to[1]) to[1]++;
        }else{
            to[0]=max(to[0],to[1]);
            to[1]=max(to[0],to[1]);
        }
        dp[i.f(0)]=to[0];
        dp[i.f(1)]=to[1];
    }
    int ans=0;
    for (auto i:dp){
        if (i.second) ans=max(ans,i.second-1);
    }
    cout<<ans<<"\n";
}

int32_t main() {
    cin.tie(0)->sync_with_stdio(false);

    int t = 1; cin >> t;
    while (t--) {
        solve();
    }
}