import bisect
import math
import string
import sys
from collections import defaultdict
from itertools import accumulate
from math import isqrt, inf
from typing import List, Tuple

sys.setrecursionlimit(10 ** 6)

MOD = 998244353

int1 = lambda x: int(x) - 1
input = lambda: sys.stdin.readline().rstrip('\n')
ii = lambda: int(input())
vi = lambda: list(map(int, input().split()))
vi1 = lambda: list(map(int1, input().split()))


def dbg(*args, **kwargs):
    print(*(repr(arg) for arg in args), *(f'{k}: {repr(v)}' for k, v in kwargs.items()),
          sep='; ', file=sys.stderr, flush=True)


def main():
    t = ii()
    for _ in range(t):
        n = ii()
        xs, ys = [defaultdict(int) for _ in range(2)]
        for _ in range(2 * n):
            x, y, v = input().split()
            x, y = int(x), int(y)
            if v == 'x':
                ys[y] += 1
            else:
                xs[x] += 1
        xsum = sum(xs.values())
        ysum = sum(ys.values())
        xr = sum(v // 2 for v in xs.values())
        yr = sum(v // 2 for v in ys.values())

        print('Yes' if xr >= (xsum - ysum) // 2 and yr >= (ysum - xsum) // 2 else 'No')


def _start():
    if (ret := main()) is not None:
        print(*ret) if isinstance(ret, List) or isinstance(ret, Tuple) else print(ret)


if __name__ == '__main__':
    _start()