#include<bits/stdc++.h>
using namespace std;
int n,m,op,x,y,f[20005];
int find(int a)
{
    if(f[a]!=a) return f[a]=find(f[a]);
    return a;
}
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;
    for(int i=1;i<=m;i++)
    {
        scanf("%d%d%d",&op,&x,&y);
        int r1=find(x),r2=find(y);
        if(op==0)
        {
            f[r1]=r2;
        }
        else
        {
            if(r1==r2) printf("Yes\n");
            else printf("No\n");
        }
    }
    return 0;
}