#include<bits/stdc++.h>
using namespace std;
#define MAXN 10010
//#define MAXM 0

int father[MAXN];
int n,m,x,y;
int op;

int find(int x){
	if(father[x]!=x) father[x] = find(father[x]);
	return father[x];
}

void unionn(int a,int b){
	father[find(b)]=find(a);
}

void judge(int a,int b){
	int ansa=find(a),ansb=find(b);
	if(ansa==ansb)cout<<"Y";
	else cout<<"N";
	cout<<endl;
}

int main(){
	cin>>n>>m;
	for(int i=1;i<=n;++i){
		father[i]=i;
	}
	for(int i=1;i<=m;++i){
		cin>>op>>x>>y;
		if(op==1)unionn(x,y);
		else judge(x,y);
	}
	return 0;
}