#include<bits/stdc++.h>
using namespace std;
#define N 10005
#define For(i,x,y)for(i=x;i<=y;i++)
int dep[N],fa[N];
int read()
{
int A;
bool K;
char C;
C=A=K=0;
while(C<'0'||C>'9')K|=C=='-',C=getchar();
while(C>'/'&&C<':')A=(A<<3)+(A<<1)+(C^48),C=getchar();
return(K?-A:A);
}
void write(int X)
{
if(X<0)putchar('-'),X=-X;
if(X>9)write(X/10);
putchar(X%10+48);
}
int find(int p)
{
if(fa[p]!=p)fa[p]=find(fa[p]);
return fa[p];
}
void unite(int u,int v)
{
int a=find(u),b=find(v);
if(a==b)return;
if(dep[a]<=dep[b])fa[a]=b;
else fa[b]=a;
if(dep[a]==dep[b])dep[b]++;
}
int main()
{
int n,m,i,x,y,z;
n=read(),m=read();
For(i,1,n)fa[i]=i,dep[i]=1;
For(i,1,m)
{
z=read(),x=read(),y=read();
if(z==1)unite(x,y);
else puts(find(x)==find(y)?"Y":"N");
}
return 0;
}