#include<cstdio>

using namespace std;

int n,m,p;

int father[];

int find(int x)

{

    if(father[x]!=x)

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

    return father[x];

}

void unionn(int i,int j)

{

    father[j]=i;

}

int main()

{

    scanf("%d%d",&n,&m);

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

        father[i]=i;

    for(int i=;i<=m;i++)

    {

        int x,y,z,r1,r2;

        scanf("%d%d%d",&z,&x,&y);

        if(z==)

        {

            r1=find(x);

            r2=find(y);

            if(r1!=r2)

                unionn(r1,r2);

        }

        if(z==)

        {

            if(find(x)==find(y))

                printf("Y\n");

            else    printf("N\n");

        }

    }

    return ;

}