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

int N,M,T[Nmax],Rank[Nmax];

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

void Reunion(int x,int y)
{
     int Rx=gr(x),Ry=gr(y);
     if(Rank[Rx]<Rank[Ry])T[Rx]=Ry;
          else if(Rank[Rx]>Rank[Ry])T[Ry]=Rx;
               else T[Ry]=Rx , ++Rank[Rx];
}

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);
          if(op==2)if(gr(x)==gr(y))g<<"DA\n";
                         else g<<"NU\n";
     }
     f.close();g.close();
     return 0;
}