#include<bits/stdc++.h>
using namespace std;
int n,x,y,nx,ny;
int dx[10]={0,1,-1,0,0};
int dy[10]={0,0,0,1,-1};
int vis[1001][1001];
struct node{
	int x,y;
}q[10000005],a[1005];
int bfs()
{
	int h=1,t=1;
	q[h].x=1;
	q[h].y=1;
	vis[1][1]=1;
	while(h<=t)
	{
		if(q[h].x==n&&q[h].y==n)
		{
			cout<<"Yes"<<endl<<endl;
			return 0;
		}
		for(int i=1;i<=4;i++)
		{
			nx=q[h].x+dx[i];
			ny=q[h].y+dy[i];
			if(nx>=1&&nx<=n&&ny>=1&&ny<=n&&vis[nx][ny]==0)
			{
				q[++t].x=nx;
				q[t].y=ny;
				vis[nx][ny]=1;
			}
		}
		vis[a[t].x][a[t].y]=1;
		h++;
	}
	cout<<"No"<<endl<<endl;
}
int main()
{
	int t;
	cin>>t;
	while(t--)
	{
		memset(q,0,sizeof(q));
		memset(vis,0,sizeof(vis));
		memset(a,0,sizeof(a));
		cin>>n;
		for(int i=1;i<=2*n-2;i++)
			cin>>a[i].x>>a[i].y;
		bfs();
	}
	return 0;
}