#include <iostream>
#include <fstream>
using namespace std;
#define NMAX 100001
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int n,m,op,x,y,rad_X, rad_Y, rang[NMAX],radacina[NMAX];

int cautaRadacina(int x)
{
    int R=x;
    while(radacina[R] != R) //aflam in ce multime se afla nodul x
    {
        R=radacina[R];
    }
    while(radacina[x]!=x)  //mai parcurgem o data drumul de la x la radacina si unim toate nodurile direct de radacina
    {
        int aux=radacina[x];
        radacina[x]=R;
        x=aux;
    }
    return R; //intoarcem radacina
}

void reuniune(int x, int y)
{
    if(rang[x]<rang[y])
        radacina[x]=y;
    else
        radacina[y]=x;
    if(rang[x]==rang[y])
        rang[x]++;
}

int main()
{
    fin >> n >> m;
    for(int i=1;i<=n;i++)
    {
        //construim multimile si le retinem inaltimile
        radacina[i]=i;
        rang[i]=1;
    }
    for(int i=1;i<=m;i++)
    {
        fin >> op >> x >> y;
        rad_X= cautaRadacina(x);
        rad_Y= cautaRadacina(y);
        if(op==1)
        {
            if(rad_X!=rad_Y)  //daca cele doua elemente nu se afla in aceeasi multime, le reunim
                reuniune(rad_X, rad_Y);
        }
        if(op==2){
            if(rad_X==rad_Y) //daca se afla in aceeasi multime Da, altfel Nu
                fout << "DA" << endl;
            else
                fout << "NU" << endl;
        }
    }
    return 0;
}