#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
const int maxn=10010;
int fa[maxn],n,m;
void init(){
    for(int i=1;i<=n;i++)fa[i]=i;
}
int find(int x){
    if(fa[x]==x)return x;
    return fa[x]=find(fa[x]);
}
void unite(int x,int y){
    x=find(x);y=find(y);
    if(x==y)return;
    fa[x]=y;
}
int main()
{
    scanf("%d%d",&n,&m);
    init();int x,y,z;
    for(int i=1;i<=m;i++){
        scanf("%d%d%d",&z,&x,&y);
        if(z==1)unite(x,y);
        else{if(find(x)==find(y))puts("Y");else puts("N");}
    }
    return 0;
}