#include <iostream>
#include <cstdio>
#define maxc 100005
using namespace std;

int n,m,op,h[maxc],G[maxc],y;

vector <int > G[maxc];

int findn(int x)
{
    for (i=x; G[i]!=i;i=G[i]) ///caut radacina

    for (; G[x]!=x;)
    {
        int aux=G[x]; ///salvez spre ce e orientat initial nodul
        G[x]=i; ///orientez nodul actual spre radacina
        x=aux; ///merg mai departe pe conexiunea veche
    }
    return i;
}


void rezolv()
{
    scanf("%d%d",&n,&m);
    for (int i=1; i<=m; ++i)
    {
        scanf("%d%d%d",&op,&x,&y);
        if (op==1)
        {

        }
    }
}


int main()
{
    freopen("disjoint.in","r",stdin);
    freopen("disjoint.out","w",stdout);

    return 0;
}