package no3622_perfect_matching_crab;
import java.util.*;
public class Main {

	public static void main(String[] args) {
		// TODO 自動生成されたメソッド・スタブ
		Scanner sc = new Scanner(System.in);
		int t = sc.nextInt();
		StringBuilder sb = new StringBuilder();
		while(t > 0) {
			t--;
			int n = sc.nextInt();
			HashMap<Integer,Integer> x = new HashMap<>();
			HashMap<Integer,Integer> y = new HashMap<>();
			int xc = 0;
			int yc = 0;
			for(int i = 0;i < 2 * n;i++) {
				int a = sc.nextInt();
				int b = sc.nextInt();
				char c = sc.next().charAt(0);
				if(c == 'x') {
					xc++;
					if(!x.containsKey(b)) {
						x.put(b, 0);
					}x.put(b, x.get(b) + 1);
				}else {
					yc++;
					if(!y.containsKey(a)) {
						y.put(a, 0);
					}y.put(a,y.get(a) + 1);
				}
			}int xsub = xc - yc;
			int ysub = yc - xc;
			int makeX = 0;
			int makeY = 0;
			for(int s:x.keySet()) {
				makeX += x.get(s)/2 * 2;
			}for(int s:y.keySet()) {
				makeY += y.get(s)/2 * 2;
			}sb.append(xsub <= makeX && ysub <= makeY ? "Yes\n":"No\n");
		}System.out.print(sb);
	}

}