#include <fstream>

using namespace std;
ifstream fin ("disjoint.in");
ofstream fout ("disjoint.out");
const int NMAX=100000;
int t[NMAX+5], h[NMAX+5];
int FindSet(int x)
{
    int cx=x, aux;
    while(t[x]!=x)
        x=t[x];
    ///Incerc sa optimizez radacina pentru urmatoarele operatii
    ///Cu alte cuvine aici fac compresia drumurilor
    while(cx!=x)
    {
        aux=t[cx];
        t[cx]=x;
        cx=aux;
    }
    return x;

}
void UnionSet(int x, int y)
{
    /// x si y sunt radacinile celor 2 arbori
  if(h[x]==h[y])
  {
      t[x]=y;
      h[y]++;
  }
  else
  {
      if(h[x]>h[y])
          t[y]=x;
      else
        t[x]=y;
  }
}
int main()
{
    int n, m, x, y, tx, ty, i, val;
    fin>>n>>m;
    for(i=1;i<=n;++i)
    {
        h[i]=1;
        t[i]=i;
    }
    for(i=1;i<=m;++i)
    {
        fin>>val>>x>>y;
        tx=FindSet(x);
        ty=FindSet(y);
        if(val==1)
            UnionSet(tx, ty);
        else
        {
            if(tx==ty)
                fout<<"DA"<<"\n";
            else
                fout<<"NU"<<"\n";
        }
    }
    return 0;
}