import sys
readline = sys.stdin.readline

class UnionFind(object):
    def __init__(self, n=1):
        self.par = [i for i in range(n)]
        self.rank = [0 for _ in range(n)]
        self.size = [1 for _ in range(n)]

    def find(self, x):
        if self.par[x] == x:
            return x
        else:
            self.par[x] = self.find(self.par[x])
            return self.par[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)
        if x != y:
            if self.rank[x] < self.rank[y]:
                x, y = y, x
            if self.rank[x] == self.rank[y]:
                self.rank[x] += 1
            self.par[y] = x
            self.size[x] += self.size[y]

    def is_same(self, x, y):
        return self.find(x) == self.find(y)

    def get_size(self, x):
        x = self.find(x)
        return self.size[x]

from bisect import *
from copy import deepcopy
def compress(lst):
    """
    B: lstを座圧したリスト
    D: 元の値からindexを取得する辞書
    """
    B = []
    D = dict()
    vals = deepcopy(lst)
    vals = list(set(vals))
    vals.sort()
    for i in range(len(lst)):
        ind = bisect_left(vals, lst[i])
        B.append(ind)
    for i in range(len(B)):
        D[lst[i]] = B[i]
    return B, D

def f(c):
    if c == "R":
        return 0
    elif c == "G":
        return 1
    else:
        return 2



T = int(readline())
for _ in range(T):
    N = int(readline())
    C, D = [0] * N, [0] * N
    for i in range(N):
        C[i], D[i] = readline().split()
    D, _ = compress(D)
    C = list(map(f, C))
    U = UnionFind(3 * N)
    for i in range(N):
        U.union(i, N + C[i])
        U.union(i, N + 3 + D[i])
    
    S = set()
    for i in range(N):
        S.add(U.find(i))
    print("YES") if len(S) == 1 else print("NO")