#include<iostream> 
using namespace std;
int n,m;
int fa[20010];
inline int find(int x){
    if(fa[x]==x) return x;
    return fa[x]=find(fa[x]);
}
inline void merge(int x,int y){
    x=find(x),y=find(y);
    if(x!=y) fa[x]=y;
}
int main(){
    freopen("relation.in","r",stdin);
    freopen("relation.out","w",stdout);
    
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++) fa[i]=i;
    while(m--){
        int op,x,y;scanf("%d%d%d",&op,&x,&y);
        if(op==0) merge(x,y);
        else{
            if(find(x)==find(y)) printf("Yes\n");
            else printf("No\n");
        }
    }
    
    return 0;
}