#include<bits/stdc++.h>
using namespace std;
stack<int>q;
int m,n,a[1005],b[1005],sum=1;
int main()
{
	cin>>m;
	for(int i=1;i<=m;i++){
		cin>>n;
		for(int j=1;j<=n;j++){
			cin>>a[j];
			cin>>b[j];
			q.push(a[j]);
			while(q.top()==b[sum]){
			q.pop();
			sum++;
				while(sum==n+1){
					if(q.empty()){
						cout<<"Yes"<<endl;
						break;
					}
					else{
						cout<<"No"<<endl;
						break;
					}
				}
			}	
		}
	}
 	return 0;
}