#include <fstream>
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int T[100001],RT[100001];//vectorul de tati(T[] si vector de rang tati RT[](pentru "Reuniunea de rang")
int i,n,m,x,y,op;
int rad(int x)
{
    int r, y;
    for (r=x;T[r]!=r;r=T[r]);   //merg in sus pe arbore pana gasesc radacina( un nod care pointeaza catre el insusi)

    while(T[x]!=x)     //aplic compresia drumurilor
      {  y = T[x]; T[x] = r;  x = y;  }
    return r; //returnez radacina
}
void reuneste( int x,int y)
{
    if(RT[x]>RT[y]) T[y]=x;     //unesc multimea cu rang mai mic de cea cu rang mai mare
    else T[x]=y;
    if(RT[x]==RT[y]) RT[y]++;   //in caz ca rangurile erau egale atunci cresc rangul noii multimi cu 1
}
int main()
{
    f>>n>>m;
    for(i=1;i<=n;i++) {T[i]=i; //fiecare radacina indica la ea insasi
                       RT[i]=1;//initial toti arborii au inaltimea 1
                      }
    for(i=1;i<=m;i++)
    {
        f>>op>>x>>y;
        if (op==2) { if(rad(x)==rad(y)) g<<"DA\n";
                    else g<<"NU\n";}
        else reuneste(rad(x),rad(y));
    }
    return 0;
}