import sys

# sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = -1-(-1 << 31)
inf = -1-(-1 << 62)

# md = 10**9+7
md = 998244353

from collections import Counter

def solve():
    n=II()
    xy=[Counter(),Counter()]
    cnt=[0,0]
    for _ in range(n*2):
        x,y,c=SI().split()
        x,y=int(x),int(y)
        if c=="x":
            cnt[0]+=1
            xy[0][y]+=1
        else:
            cnt[1]+=1
            xy[1][x]+=1
    if cnt[0]<cnt[1]:
        cnt.reverse()
        xy.reverse()
    p=0
    for c in xy[0].values():p+=c//2
    return cnt[0]-cnt[1]<=p*2

for _ in range(II()): print("Yes" if solve() else "No")