#include <iostream>
#include<fstream>
#define NMAX 100001
using namespace std;

ifstream f("disjoint.in");
ofstream g("disjoint.out");

int n,m,i,cod,x,y;
int t[NMAX];

int cauta(int nod)                   // det daca doua elemente sunt in aceeasi multime.
{
    if(nod!=t[nod])
        return t[nod]=cauta(t[nod]);
    else return nod;
}

void uneste(int x,int y)           //face reuniunea celor doua multimi.
{
    x=cauta(x);
    y=cauta(y);
    t[x]=y;
}

int main()
{
    f>>n>>m;
    for(i=1; i<=n; i++)
        t[i]=i;
    for(i=1; i<=m; i++)
    {
        f>>cod>>x>>y;
        if(cod==1) uneste(x,y);
        else if (cauta(x)==cauta(y)) g<<"DA\n";
        else g<<"NU\n";
    }
    return 0;

}