#include<cstdio>
#include<iostream>
#include<map>
#include<utility>
#include<vector>
#include<cstring>
#include<algorithm>
#define RI register int
#define CI const int&
#define fi first
#define se second
using namespace std;
const int N=205;
int t,n,m,mat[N],vis[N],ok[N]; pair <int,int> c[N],o[N];
map <int,vector <int>> BR,BC; vector <int> v[N];
inline bool find(CI now,CI idx)
{
    for (auto to:v[now]) if (vis[to]!=idx)
    {
        vis[to]=idx;
        if (mat[to]==-1||find(mat[to],idx))
        return mat[to]=now,1;
    }
    return 0;
}
int main()
{
    // freopen("H.in","r",stdin);
    for (scanf("%d",&t);t;--t)
    {
        scanf("%d",&n); BR.clear(); BC.clear();
        for (RI i=1;i<=n;++i)
        scanf("%d%d",&c[i].fi,&c[i].se);
        scanf("%d",&m);
        for (RI i=1;i<=m;++i)
        {
            scanf("%d%d",&o[i].fi,&o[i].se);
            BR[o[i].fi].push_back(o[i].se);
            BC[o[i].se].push_back(o[i].fi);
        }
        for (auto& [_,it]:BR) sort(it.begin(),it.end());
        for (auto& [_,it]:BC) sort(it.begin(),it.end());
        vector <pair <int,int>> L,R; bool flag=1;
        for (RI i=1;i<=n;++i) for (RI j=i+1;j<=n;++j)
        {
            if (c[i].fi!=c[j].fi) continue;
            int l=c[i].se,r=c[j].se;
            if (l>r) swap(l,r);
            if (l+1==r) flag=0;
            auto& it=BR[c[i].fi];
            if (lower_bound(it.begin(),it.end(),l)!=lower_bound(it.begin(),it.end(),r)) continue;
            L.push_back({i,j});
        }
        for (RI i=1;i<=n;++i) for (RI j=i+1;j<=n;++j)
        {
            if (c[i].se!=c[j].se) continue;
            int l=c[i].fi,r=c[j].fi;
            if (l>r) swap(l,r);
            if (l+1==r) flag=0;
            auto& it=BC[c[i].se];
            if (lower_bound(it.begin(),it.end(),l)!=lower_bound(it.begin(),it.end(),r)) continue;
            R.push_back({i,j});
        }
        if (!flag) { puts("-1"); continue; }
        // for (auto [x,y]:L) printf("L:(%d,%d)\n",x,y);
        // for (auto [x,y]:R) printf("R:(%d,%d)\n",x,y);
        for (RI i=0;i<L.size();++i)
        for (RI j=0;j<R.size();++j)
        {
            int X=c[L[i].fi].fi,Y=c[R[j].fi].se;
            int xl=c[R[j].fi].fi,xr=c[R[j].se].fi;
            int yl=c[L[i].fi].se,yr=c[L[i].se].se;
            if (xl>xr) swap(xl,xr);
            if (yl>yr) swap(yl,yr);
            if (X<=xl||X>=xr||Y<=yl||Y>=yr) continue;
            v[i].push_back(j);
        }
        memset(vis,-1,sizeof(vis));
        memset(ok,-1,sizeof(ok));
        memset(mat,-1,sizeof(mat));
        for (RI i=0;i<L.size();++i) find(i,i);
        vector <pair <int,int>> ans;
        for (RI i=0;i<R.size();++i)
        if (mat[i]!=-1)
        {
            int u=mat[i],v=i; ok[u]=1;
            int X=c[L[u].fi].fi,Y=c[R[v].fi].se;
            ans.push_back({X,Y});
        }
        for (RI i=0;i<L.size();++i)
        if (ok[i]==-1)
        {
            auto [u,v]=L[i];
            int l=c[u].se,r=c[v].se;
            if (l>r) swap(l,r);
            ans.push_back({c[u].fi,l+1});
        }
        for (RI i=0;i<R.size();++i)
        if (mat[i]==-1)
        {
            auto [u,v]=R[i];
            int l=c[u].fi,r=c[v].fi;
            if (l>r) swap(l,r);
            ans.push_back({l+1,c[u].se});
        }
        printf("%d\n",(int)ans.size());
        for (auto [x,y]:ans) printf("%d %d\n",x,y);
    }
    return 0;
}