#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int T,N;
ll X[202020],Y[202020],A[202020];


void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>T;
	while(T--) {
		cin>>N;
		int C[2]={};
		FOR(i,2*N) {
			cin>>X[i]>>Y[i]>>s;
			A[i]=s=="y";
			C[A[i]]++;
		}
		int df;
		if(C[0]>=C[1]) {
			df=C[0]-C[1];
			set<int> Ys;
			FOR(i,2*N) if(A[i]==0) {
				if(Ys.count(Y[i])) {
					df-=2;
					Ys.erase(Y[i]);
				}
				else {
					Ys.insert(Y[i]);
				}
			}
		}
		else {
			df=C[1]-C[0];
			set<int> Xs;
			FOR(i,2*N) if(A[i]==1) {
				if(Xs.count(X[i])) {
					df-=2;
					Xs.erase(X[i]);
				}
				else {
					Xs.insert(X[i]);
				}
			}
		}
		if(df<=0) {
			cout<<"Yes"<<endl;
		}
		else {
			cout<<"No"<<endl;
		}
	}
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}