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

int N,M,T[Nmax];

inline bool SameForest(int x,int y)
{
     while(T[x]!=x)x=T[x];
     while(T[y]!=y)y=T[y];
     if(x==y)return 1;
     else return 0;
}

void Reunion(int x,int y)
{
     T[x]=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);
          if(op==2)if(SameForest(x,y))g<<"DA\n";
                         else g<<"NU\n";
     }
     f.close();g.close();
     return 0;
}