#include<bits/stdc++.h>
int father[220006];
int find(int k){//寻找 
	if(father[k]==k)return k;
	return father[k]=find(father[k]);//边界 
} 
int main(){
	int n,m;
	std::cin>>n>>m;
	for(int i=1;i<=n;i++){
		father[i]=i;
	}
	for(int i=1;i<=m;i++){
		int z,x,y;
		std::cin>>z>>x>>y;
		if(z==1){   // 合并根节点 
			father[find(x)]=find(y);
		}
		else{
			if(find(x)==find(y)){ 
				std::cout<<"Y"<<"\n";
			}
			else{
				std::cout<<"N"<<"\n";
			}
		}
	}
}