#include <iostream>
#include <fstream>
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int n,m,tata[100005];

int drum1(int xp)
{
   int r;
   while( xp != 0 )
   {
       r = xp;
       xp = tata[xp];
   }
   return r;
}

int drum(int xp)
{
   if( tata[xp] == 0 )
     return xp;

   tata[xp] = drum( tata[xp] );

   return tata[xp];
}

int main()
{
    int q,x,y,rx,ry;
    f>>n>>m;
    for(int i=1 ; i <= m ; i++)
    {
        f>>q>>x>>y;

        if( q == 1 )
        {
            ry = drum(y);

            if( tata[x] != 0 )
            tata[ry] = tata[x];
            else
            tata[ry] = x;
        }

        if( q == 2 )
        {
            rx = drum(x);
            ry = drum(y);

            if( rx == ry )
               g<<"DA"<<'\n';
            else
               g<<"NU"<<'\n';
        }
    }

    //for(int i=1 ; i <= n ; i++)
      //  cout<<tata[i]<<' ';

    return 0;
}