#include <bits/stdc++.h>
using namespace std;
ifstream in("disjoint.in");
ofstream out("disjoint.out");

int t[100001],rang[100001];

int root(int nod)
{
 int next , R= nod ;
 while(t[R]!=R)R=t[R];

 // in R am radacina

 while(t[nod]!=nod)
 {
     next=t[nod];
     t[nod]=R;
     nod = next;
  }
 return R ;
}

void unite(int x , int y )
{
    t[y]=x;
    rang[x]+=y;
}

int main()
{
 int n , m , op , i;
 in >> n >> m ;
  for ( int i = 1 ; i<= n ; ++i)
    {
        rang[i]=1;
        t[i]=i;
    }
 for ( i = 1 ; i <=m ; ++ i )
 {
     int x ,y ;
     in >> op >> x >> y ;
     if(op==1)
     {
         if(root(x)!=root(y)) unite(x,y);
     }
     else
     {
         if(root(x)!=root(y)) out<<"NU\n";
         else out<<"DA\n";
     }


 }


return 0;
}