#include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<cstring>
#include<queue>
#include<map>
#define LL long long
using namespace std;
const int inf=1e9;
const int mod=998244353;
//int mod;
const int Base=23,Base2=27;
inline int lowbit(int x){return x&(-x);}
inline int Jia(int x){return x>=mod?x-mod:x;}
inline int Jian(int x){return x>=0?x:x+mod;}
int KSM(int a,int b){
	int Ans=1;
	while(b){
		if(b&1)Ans=1LL*Ans*a%mod;
		a=1LL*a*a%mod;
		b>>=1;
	}
	return Ans;
}
inline int read(){
	int k=0,ty=1;
	char ch=getchar();
	while(ch<'0'||ch>'9'){
		if(ch=='-')ty=-1;
		ch=getchar();
	}
	while(ch<='9'&&ch>='0'){
		k=k*10+ch-'0';
		ch=getchar();
	}
	return k*ty;
}
int gcd(int a,int b){
	if(!b)return a;
	return gcd(b,a%b);
}
const int maxn=5e5+5;
struct d{
	int to,next,flow,p1,p2;
}E[maxn];
struct dd{
	int x,y;
}a[maxn];
int h[maxn],n,S,T,all,cnt,dis[maxn],b[maxn],c[maxn],ans;
vector<int>v1[205],v2[205],id1[205],id2[205];
int vis1[205][205],vis2[205][205],m,cur[maxn];
vector<int>::iterator it1,it2;
void add(int x,int y,int z,int p1,int p2){
	E[++cnt]=(d){y,h[x],z,p1,p2};
	h[x]=cnt;
	E[++cnt]=(d){x,h[y],0,0,0};
	h[y]=cnt;
}
bool BFS(){
	queue<int>q;
	for(int i=1;i<=all;++i)dis[i]=inf;
	dis[S]=0;q.push(S);cur[S]=h[S];
	while(!q.empty()){
		int x=q.front();q.pop();
		for(int i=h[x];i;i=E[i].next){
			int y=E[i].to;
			if(E[i].flow&&dis[y]==inf){
				dis[y]=dis[x]+1;
				cur[y]=h[y];
				q.push(y);
			}
		}
	}
	return dis[T]!=inf;
}
int dfs(int x,int maxflow){
	if(x==T)return maxflow;
	int res=0;
	for(int i=cur[x];i;i=E[i].next){
		int y=E[i].to;
		cur[x]=i;
		if(!E[i].flow||dis[y]!=dis[x]+1)continue;
		int t=dfs(y,min(E[i].flow,maxflow));
		res+=t;
		E[i].flow-=t;E[i^1].flow+=t;
		maxflow-=t;
		if(!maxflow)return res;
	}
	return res;
}
void Solve(){
	n=read();
	b[0]=c[0]=0;
	for(int i=1;i<=n;++i){
		a[i].x=read();a[i].y=read();
		b[++b[0]]=a[i].x;
		c[++c[0]]=a[i].y;
	}
	sort(b+1,b+1+b[0]);sort(c+1,c+1+c[0]);
	b[0]=unique(b+1,b+1+b[0])-b-1;
	c[0]=unique(c+1,c+1+c[0])-c-1;
	for(int i=1;i<=b[0];++i)v1[i].clear(),id1[i].clear();
	for(int i=1;i<=c[0];++i)v2[i].clear(),id2[i].clear();
	for(int i=1;i<=max(c[0],b[0]);++i){
		for(int j=0;j<=n;++j)vis1[i][j]=vis2[i][j]=0;
	}
	for(int i=1;i<=n;++i){
		a[i].x=lower_bound(b+1,b+1+b[0],a[i].x)-b;
		a[i].y=lower_bound(c+1,c+1+c[0],a[i].y)-c;
		v1[a[i].x].push_back(c[a[i].y]);
		v2[a[i].y].push_back(b[a[i].x]);
	}
	for(int i=1;i<=b[0];++i)sort(v1[i].begin(),v1[i].end());
	for(int i=1;i<=c[0];++i)sort(v2[i].begin(),v2[i].end());
	m=read();
	for(int i=1;i<=m;++i){
		int x=read(),y=read();
		int k=lower_bound(b+1,b+1+b[0],x)-b;
		if(k<=b[0]&&b[k]==x){
			it1=upper_bound(v1[k].begin(),v1[k].end(),y);
			if(it1!=v1[k].begin()&&it1!=v1[k].end()){
				int z=it1-v1[k].begin();
				--z;
				vis1[k][z]=1;
			}
		}
		k=lower_bound(c+1,c+1+c[0],y)-c;
		if(k<=c[0]&&c[k]==y){
			it1=upper_bound(v2[k].begin(),v2[k].end(),x);
			if(it1!=v2[k].begin()&&it1!=v2[k].end()){
				int z=it1-v2[k].begin();
				--z;
				vis2[k][z]=1;
			}
		}
	}
//	for(int i=1;i<=b[0];++i){
//		cout<<"faf  "<<b[i]<<'\n';
//		for(int j=0;j<v1[i].size();++j)cout<<vis1[i][j]<<' ';cout<<'\n';
//	}
	all=0;S=++all;T=++all;ans=0;
	for(int i=1;i<=n+2;++i)h[i]=0;cnt=1;
	for(int i=1;i<=b[0];++i){
		for(int j=0;j+1<v1[i].size();++j){
			if(v1[i][j]+1==v1[i][j+1]){
//				cout<<b[i]<<'\n';
//				cout<<v1[i][j]<<' '<<v1[i][j+1]<<'\n';
				cout<<-1<<'\n';
				return;
			}
			if(vis1[i][j]){
				id1[i].push_back(0);
				continue;
			}
			++ans;
			id1[i].push_back(++all);
			add(S,all,1,0,0);
		}
	}
//	cout<<"FAF\n";
	for(int i=1;i<=c[0];++i){
		for(int j=0;j+1<v2[i].size();++j){
			if(v2[i][j]+1==v2[i][j+1]){
				cout<<-1<<'\n';
				return;
			}
			if(vis2[i][j]){
				id2[i].push_back(0);
				continue;
			}
			++ans;
			id2[i].push_back(++all);
			add(all,T,1,0,0);
		}
	}
	for(int i=1;i<=b[0];++i){
		for(int j=0;j+1<v1[i].size();++j){
			int D=v1[i][j]+1,U=v1[i][j+1]-1;
			int kl=lower_bound(c+1,c+1+c[0],D)-c;
			int kr=upper_bound(c+1,c+1+c[0],U)-c-1;
			for(int k=kl;k<=kr;++k){
				it1=lower_bound(v2[k].begin(),v2[k].end(),b[i]);
				if(it1==v2[k].begin()||it1==v2[k].end())continue;
				int t=it1-v2[k].begin();
				--t;
				if(!id1[i][j]||!id2[k][t])continue;
				add(id1[i][j],id2[k][t],1,b[i],c[k]);
			}
		}
	}
//	cout<<"Ans::"<<ans<<'\n';
	while(BFS())ans-=dfs(S,inf);
	cout<<ans<<'\n';
	for(int i=2;i<=cnt;i+=2){
		if(E[i].flow==0&&E[i].p1!=0){
			cout<<E[i].p1<<' '<<E[i].p2<<'\n';
			int x=E[i].p1,y=E[i].p2;
			int k=lower_bound(b+1,b+1+b[0],x)-b;
			if(k<=b[0]&&b[k]==x){
				it1=upper_bound(v1[k].begin(),v1[k].end(),y);
				if(it1!=v1[k].begin()&&it1!=v1[k].end()){
					int z=it1-v1[k].begin();
					--z;
					vis1[k][z]=1;
				}
			}
			k=lower_bound(c+1,c+1+c[0],y)-c;
			if(k<=c[0]&&c[k]==y){
				it1=upper_bound(v2[k].begin(),v2[k].end(),x);
				if(it1!=v2[k].begin()&&it1!=v2[k].end()){
					int z=it1-v2[k].begin();
					--z;
					vis2[k][z]=1;
				}
			}
		}
	}
//	return;
	for(int i=1;i<=b[0];++i){
		for(int j=0;j+1<v1[i].size();++j){
			if(vis1[i][j]==0)cout<<b[i]<<' '<<v1[i][j]+1<<'\n';
		}
	}
	for(int i=1;i<=c[0];++i){
		for(int j=0;j+1<v2[i].size();++j){
			if(vis2[i][j]==0)cout<<v2[i][j]+1<<' '<<c[i]<<'\n';
		}
	}
}
int main(){
//	freopen("data.txt","r",stdin); 
	int T=read();
	while(T--)Solve();
	return 0;
}
/*
1
7
7 1
8 2
9 7
7 7
8 5
9 6
10 2
2
9 1
11 1
*/