蓝桥杯-蓝桥幼儿园

"""
https://www.lanqiao.cn/problems/1135/learning/?page=1&first_category_id=1&name=%E8%93%9D%E6%A1%A5%E5%B9%BC%E5%84%BF%E5%9B%AD
"""
# 找x的祖宗
# def Findroot(x):
#   while x != p[x]:
#     x = p[x]
#   return x
def Findroot(x):
  if x == p[x]:
    return x
  # 路径压缩
  p[x] = Findroot(p[x])
  return p[x]

# 合并x, y所在的集合
def Merge(x, y):
  rootx = Findroot(x)
  rooty = Findroot(y)
  p[rooty] = rootx

# 查询x, y是否是同一个祖宗
def Query(x, y):
  rootx = Findroot(x)
  rooty = Findroot(y)
  return rootx == rooty

n, q = map(int, input().split())
p = list(range(n + 1))
for _ in range(q):
  op, x, y = map(int, input().split())
  if op == 1:
    Merge(x, y)
  else:
    if Query(x, y):
      print("YES")
    else:
      print("NO")