#include <fstream>
#define Nmax 100009
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");

int N,M,T[Nmax];

int gr(int node)
{
     if(node!=T[node])T[node]=gr(T[node]);
     return T[node];
}

void Reunion(int x, int y)
{
     T[gr(x)]=gr(y);
}

int main()
{
     f>>N>>M;
     for(int i=1;i<=N;++i)T[i]=i;
     for(int i=1;i<=M;++i)
     {
          int op,x,y;
          f>>op>>x>>y;
          if(op==1)Reunion(x,y);
               else if(gr(x)==gr(y))g<<"DA\n";
                              else g<<"NU\n";
     }
     f.close();g.close();
     return 0;
}