#include <fstream>

using namespace std;

int t[100020], r[100020], n, m;

void uniune(int x, int y)
{
    if(r[x]>r[y])
       t[y]=x;
    else
        if(r[x]<r[y])
           t[x]=y;
        else
            {
             t[y]=x;
             r[x]++;
            }
}
int find(int x)
{
   int rad=x;
   while(t[rad]!=0)
        rad=t[rad];
   int aux;
   while(t[x]!=0)
         {
          aux=t[x];
          t[x]=rad;
          x=aux;
         }
   return rad;
}

int main()
{
   int mod, x, y, r1, r2;
   ifstream fin("disjoint.in");
   ofstream fout("disjoint.out");
   fin >> n >> m;
   while(m>0)
        {
         fin >> mod >> x >> y;
         if(mod==1)
         {
          r1=find(x);
          r2=find(y);
          if(r1!=r2)
             uniune(r1,r2);
         }
         else
            {
             if(find(x)==find(y))
                fout<<"DA\n";
             else
                fout<<"NU\n";
            }
        m--;
         }
   fin.close();
   fout.close();
   return 0;
}