#include <iostream>
using namespace std;
const int N=2e4+10;
int f[N],n,m,u,v,op;
int found(int x){
    return f[x]==x?x:(f[x]=found(f[x]));
}
int main(){
	freopen("relation.in","r",stdin);
	freopen("relation.out","w",stdout);
    scanf("%d %d",&n,&m);
    for(int i=1;i<=n;i++)f[i]=i;
    while(m--){
        scanf("%d %d %d",&op,&u,&v);
        u=found(u),v=found(v);
        if(op==0){
        	if(u!=v)f[u]=v;
		}else if(op==1){
            if(u==v)printf("Yes\n");
            else printf("No\n");
        }
    }
    return 0;
}