#include <fstream>

using namespace std;
const int NMAX=100000;
int t[NMAX+5],h[NMAX+5];
ifstream fin ("disjoint.in");
ofstream fout ("disjoint.out");
int FindSet(int x)
{
    while (x!=t[x])
        x=t[x];
    return x;
}
void UnionSet(int x,int y)
{
    if(h[x]==h[y])
    {
        h[x]++;
        t[y]=x;
    }
    else
        if(h[x]>h[y])
           t[y]=x;
        else
           t[x]=y;
}
int main()
{
    int n,m,i,x,y,tx,ty,k,r;
    fin>>n>>m;
    for(i=1;i<=n;i++)
    {
        t[i]=i;h[i]=1;
    }
     for(i=1;i<=m;i++)
     {
         fin>>r;
         fin>>x>>y;
         tx=FindSet(x);ty=FindSet(y);
         if(r==1)
         {
             if(tx!=ty)
                UnionSet(tx,ty);
         }
         if(r==2)
         {
             if(tx==ty)
                fout<<"DA"<<"\n";
             else
                fout<<"NU"<<"\n";
         }
     }
}