#include<bits/stdc++.h>
using namespace std;
#define cs const
#define re register
#define pb push_back
#define ll long long
#define pii pair<ll,ll>
#define gc getchar
#define fi first
#define se second
#define bg begin

template<typename tp>inline void chemx(tp &a,tp b){(a<b)?(a=b):0;}
template<typename tp>inline void chemn(tp &a,tp b){(a>b)?(a=b):0;}

inline int read(){
	char ch=gc();
	int res=0;bool f=1;
	while(!isdigit(ch))f^=ch=='-',ch=gc();
	while(isdigit(ch))res=(res+(res<<2)<<1)+(ch^48),ch=gc();
	return f?res:-res;
}
cs int N=100005;
int n,m;
int str,des,tot;
struct edge{
	int v,cap,r;
	edge(int a=0,int b=0,int c=0):v(a),cap(b),r(c){}
};
vector<edge> e[N];
inline void addedge(int u,int v,int w){
	e[u].pb(edge(v,w,e[v].size()));
	e[v].pb(edge(u,0,e[u].size()-1));
}
#define It vector<edge>::iterator
namespace Flow{
	int lev[N];It tp[N];
	queue<int> q;
	inline bool bfs(){
		memset(lev,-1,sizeof(int)*(tot+1));
		lev[str]=0,q.push(str);
		while(!q.empty()){
			int u=q.front();q.pop();
			for(edge &x:e[u]){
				if(lev[x.v]==-1&&x.cap>0){
					lev[x.v]=lev[u]+1,q.push(x.v);
				}
			}
		}
		return lev[des]!=-1;
	}
	int dfs(int u,int flow){
		if(u==des)return flow;
		int res=0;
		for(It &it=tp[u];it!=e[u].end();it++){
			if(lev[it->v]==lev[u]+1&&it->cap>0){
				int now=dfs(it->v,min(it->cap,flow-res));
				res+=now,it->cap-=now,e[it->v][it->r].cap+=now;
				if(res==flow)break;
			}
		}
		return res;
	}
	inline int dinic(){
		int res=0;
		while(bfs()){
			for(int i=1;i<=tot;i++)tp[i]=e[i].bg();
			res+=dfs(str,1e9);
		}
		return res;
	}
}
int r[N],c[N],cntx,cnty;
int r2[N],c2[N];
void clear(){
	for(int i=0;i<=tot;i++)e[i].clear();
	str=des=tot=0;
}
struct node{
	int t,l,r;
	node(int _t=0,int _l=0,int _r=0):t(_t),l(_l),r(_r){}
}lix[N],liy[N];
int inter(node x,node y){
	return y.l<=x.t&&x.t<=y.r&&x.l<=y.t&&y.t<=x.r;
}
void solve(){
	n=read();cntx=cnty=0;
	for(int i=1;i<=n;i++)r[i]=read(),c[i]=read();			
	m=read();
	for(int i=1;i<=m;i++)r2[i]=read(),c2[i]=read();
	tot=0,str=++tot,des=++tot;
	for(int i=1;i<=n;i++)
	for(int j=1;j<=n;j++)if(i!=j&&r[i]==r[j]&&c[i]<c[j]){
		if(c[i]+1==c[j]){
			puts("-1");
			clear();
			return;
		}	
		int ok=0;
		for(int k=1;k<=m;k++)if(r2[k]==r[i]&&c[i]<c2[k]&&c2[k]<c[j]){
			ok=1;
		}
		if(ok)continue;
		//cout<<i<<" "<<j<<'\n';
	//	cout<<r[i]<<" "<<c[i]+1<<" "<<c[j]-1<<'\n';
		lix[++cntx]=node(r[i],c[i]+1,c[j]-1);
	}
	for(int i=1;i<=n;i++)
	for(int j=1;j<=n;j++)if(i!=j&&c[i]==c[j]&&r[i]<r[j]){
		if(r[i]+1==r[j]){
			puts("-1");
			clear();
			return;
		}
		int ok=0;
		for(int k=1;k<=m;k++)if(c2[k]==c[i]&&r[i]<r2[k]&&r2[k]<r[j]){
			ok=1;
		}
		if(ok)continue;
	//	cout<<c[i]<<" "<<r[i]+1<<" "<<r[j]-1<<'\n';
		liy[++cnty]=node(c[i],r[i]+1,r[j]-1);
	}
	tot=cntx+cnty;
	//cout<<cntx<<" "<<cnty<<'\n';
	str=++tot,des=++tot;
	for(int i=1;i<=cntx;i++)addedge(str,i,1);
	for(int i=1;i<=cnty;i++)addedge(i+cntx,des,1);
	for(int i=1;i<=cntx;i++)
	for(int j=1;j<=cnty;j++)if(inter(lix[i],liy[j])){
		addedge(i,j+cntx,1);
	}
	int res=Flow::dinic();
	cout<<cntx+cnty-res<<'\n';
	
	for(int i=1;i<=cntx;i++){
		int ok=0;
		for(auto x:e[i])if(x.v==str&&x.cap==1){
			ok=1;
		}
		if(ok==0){
			cout<<lix[i].t<<" "<<lix[i].l<<'\n';
		}
	}
	//cout<<"e1\n";
	for(int i=1;i<=cnty;i++){
		int ok=0;
		for(auto x:e[i+cntx])if(x.v==des&&x.cap==0){
			ok=1;
		}
		if(ok==0){
			cout<<liy[i+cntx].l<<" "<<liy[i+cntx].t<<'\n';
		}
	}
	//cout<<"e2\n";
	for(int i=1;i<=cntx;i++){
		for(auto x:e[i])if(x.v<=cntx+cnty&&x.cap==0){
			cout<<lix[i].t<<" "<<liy[i].t<<'\n';
		}
	}
	clear();
}

int main(){
    #ifdef Stargazer
    freopen("1.in","r",stdin);
    #endif
	int T=read();
	while(T--){
		solve();
	}
}