#include<bits/stdc++.h>

using namespace std;

const int range=;

int fa[range];

int find(int x) {

    if(fa[x]!=x)

        fa[x]=find(fa[x]);

    return fa[x];

}

int main() {

    int n,m;

    cin>>n>>m;

    for(int i=; i<=n; i++) {

        fa[i]=i;

    }

    while(m--) {

        int a,x,y;

        cin>>a>>x>>y;

        if(a==) {

            fa[find(x)]=find(y);

        } else if(a==) {

            if(find(x)==find(y)) printf("Y\n");

            else printf("N\n");

        }

    }

    return ;

}