#include <iostream>
#include <fstream>
using namespace std;
#define Nmax 100010
int n,m,r[Nmax],t[Nmax],cod;
ifstream fin ("disjoint.in");
ofstream fout ("disjoint.out");
int Find(int x)
{
    int rad,elem;
    rad=x;
    while (t[rad]!=0)
        rad=t[rad];

    while (t[x]!=0)
    {
        elem=t[x];
        t[x]=rad;
        x=elem;
    }
    return rad;
}
void Union (int x,int y)
{
    if (r[x]>r[y])
        t[y]=x;
    else if (r[x]<r[y])
            t[x]=y;
         else
         {
          t[y]=x;
          r[x]++;
         }
}
int main()
{
    int x,y,r1,r2;
    fin>>n>>m;
    while (m>0)
    {
        fin>>cod>>x>>y;
        if (cod==1)
        {
            r1=Find(x);
            r2=Find(y);
            if (r1!=r2)
                Union(r1,r2);
        }
        else
        {
            if (Find(x)==Find(y))
                fout<<"DA";
            else
                fout<<"NU";
            fout<<"\n";
        }
        m--;
    }
    fin.close();
    fout.close();
    return 0;
}