#include<bits/stdc++.h>
using namespace std;
int f[10001];
int m,n,i,z,x,y;
int find(int x)
{
    return f[i]==i?i:find(f[x]);
}
int main()
{
    cin>>n>>m;
    for(i=1;i<=n;i++) f[i]=i;
    for(i=1;i<=m;i++)
    {
        cin>>z>>x>>y;
        if(z==1) 
            {if(find(x)!=find(y)) f[find(y)]=find(x);}
        else{ if(find(x)==find(y)) cout<<"Y";
              else cout<<"N";}
    }
    return 0;
}