parent and rank

#include <bits/stdc++.h>

using namespace std;
long long int fa(long long int par[],long long int a)
{
    if(par[a]==-1)
    {
        return a;
    }
    else
    {
    
        return par[a];
    }
}
void load(long long int par[],long long int rank[],long long int a,long long int b)
{
    a=fa(par,a);
    b=fa(par,b);
    if(rank[a]>rank[b])
    {
        par[b]=a;
    }
    else if(rank[b]>rank[a])
    {
        par[a]=b;
    }
    else
    {
        rank[b]++;
        par[a]=b;
    }
}
void check(long long int par[],long long int rank[],long long int a,long long int b)
{
    a=fa(par,a);
    b=fa(par,b);
    if(a==b)
    {
        cout<<"YES"<<endl;
    }
    else
    {
        cout<<"NO"<<endl;
    }
}

int main()
{
    long long int q,t,i,j,k,l,m,n,o,p,ans,a,b;
   
   
        cin>>n>>q;
   long long int par[n+1];
    long long int rank[n+1];
    for(i=1;i<=n;i++)
    {
        par[i]=-1;
        rank[i]=1;
    }
    while(q--)
    {
        cin>>k;
        if(k==0)
        {
            cin>>a>>b;
            load(par,rank,a,b);
        }
        else{
            cin>>a>>b;
            check(par,rank,a,b);
        }
    }
    
            
       
}