#include <fstream>

using namespace std;

ifstream f("disjoint.in");
ofstream g("disjoint.out");

int T[100001]; ///vectorul de tati
int n,m;

int parent(int x)
{
   int r,y;
   r=x;
   while(T[r]!=0)
    r=T[r];
   while(T[x]!=0)
   {
       y=T[x];
       T[x]=r;
       x=y;
   }
   return r;
}

void Union(int x, int y)
{
    T[y]=x;
}

int main()
{
    f>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int op,x,y;
        f>>op>>x>>y;
        if(op==2)
        {
            if(parent(x)==parent(y))
                g<<"DA\n";
            else
                g<<"NU\n";
        }
        else
            Union(parent(x),parent(y));

    }
    f.close();
    g.close();
    return 0;
}