def init(n):
    for i in range(1,n+1):
        fa[i]=i
def find(n):
    if n == fa[n] :
        return n
    return find(fa[n])
def uni(x,y):
    fa[find(x)] = find(y)
n,m = map(int, input().split())
fa = [0]*(n+1)
init(n)
for i in range(0,m):
    z,x,y = map(int, input().split())
    if z == 1:
        uni(x,y)
    if z == 2:
        if find(x) == find(y):
            print('Y')
        else:
            print('N')