#include <bits/stdc++.h>
using namespace std;
int n,m;
int f[200010];
int find(int a){
	if(f[a]==a)return a;
	return f[a]=find(f[a]);
}
int main(){
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		f[i]=i;
	}
	while(m--){
		int t,a,b;
		cin>>t>>a>>b;
		if(t==1){
			f[find(a)]=b;
		}else{
			if(find(a)==find(b)) cout<<"Y"<<endl;
			else cout<<"N"<<endl;
		}
	}
}