#include <iostream>
#include <fstream>
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int L[100005],c,x,y,n,m;
int main()
{f>>n>>m;
for(int i=1;i<=n;i++)
    L[i]=i;
for(int i=1;i<=m;i++)
{
    f>>c>>x>>y;
   if(c==1)
   {L[max(x,y)]=min(L[x],L[y]);
   for(int j=1;j<=n;j++)
    if(L[j]==max(x,y))L[j]=min(x,y);}
     if(c==2)
    {
        if(L[x]==L[y])
            g<<"DA"<<endl;
        else g<<"NU"<<endl;
    }

}

    return 0;
}