#include <iostream>
#include <cmath>
#include<cstdio>
using namespace std;
int fa[10005];
int findd(int x){
if(fa[x]==x) return x;
return fa[x]=findd(fa[x]);
}
int main()
{
int n,m;
cin>>n>>m;
for(int i=1;i<=n;i++){
fa[i]=i;
}
for(int i=1;i<=m;i++){
int op;cin>>op;
int x,y;cin>>x>>y;
int fax = findd(x);
int fay = findd(y);
if(op==1){
if(fax!=fa[y]) fa[fax]=fay;
}
else{
if(fax!=fay){
cout<<"N"<<endl;
}
else{
cout<<"Y"<<endl;
}
}
}
return 0;
}
Complejidad temporal O(mlogn)