#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream in("disjoint.in");
ofstream out("disjoint.out");
int n,m,b1,a,c,rad[100005],l[100005];
vector<int> v[100005];
queue <int> q;
void caut(int x,int y)
{
   if(l[x]<l[y])swap(x,y);
   q.push(y);
   int x1,t=l[x]+l[y];
   l[y]=l[x]=t;
   rad[y]=x;
   while(!q.empty())
   {
       x1=q.front();
       q.pop();
       for(auto i:v[x1])
       {
           if(rad[i]==y)
           {
               rad[i]=x;
               q.push(i);
           }
       }
   }
   v[x].push_back(y);
   v[y].push_back(x);
}
int main()
{
    in>>n>>m;
    for(int i=1;i<=n;i++)
    {
        l[i]=1;
        rad[i]=i;
    }
    for(int i=1;i<=m;i++)
    {
        in>>c>>a>>b1;
        if(c==1)
        {
            caut(rad[a],rad[b1]);
        }
        else
        {
            if(rad[a]==rad[b1])out<<"DA";
            else out<<"NU";
            out<<'\n';
        }

    }
    return 0;
}