#include <bits/stdc++.h>
#define NMAX 100200
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int T[NMAX],RANG[NMAX];
int N,M;
int Rad(int x)
{
    if(T[x]!=x)T[x]=Rad(T[x]);
    return T[x];
}
void unire(int x, int y)
{
    if(RANG[x]>RANG[y])
        T[y]=x;
    else T[x]=y;
    if(RANG[x]==RANG[y])
        RANG[y]++;

}
int main()
{
    int x,y,cod;
    fin>>N>>M;
    for(int i=1; i<=N; ++i)
    {
        T[i]=i;
        RANG[i]=1;
    }
    for(int i=1; i<=M; ++i)
    {fin>>cod>>x>>y;
     if(cod==2)
     {
         if(Rad(x)==Rad(y)) fout<<"DA";
         else fout<<"NU";
         fout<<"\n";
     }
     else
       unire(x,y);
    }
    return 0;
}