#include <bits/stdc++.h>
using namespace std;

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

const int nmax=1e5+3;
int n,m,task,t[nmax];

struct{
int x,y;
}M[nmax];

int radacina(int k)
{
 if(t[k]==0) return k;
 return radacina(t[k]);
}

void unite(int x,int y)
{
  int rx=radacina(x);
  int ry=radacina(y);
  if(rx!=ry)
    t[rx]=ry;
}

void schr(int x,int y)
{
   if(radacina(x)==radacina(y))
        cout<<"DA"<<'\n';
   else cout<<"NU"<<'\n';
}


int main(){
int x1,y1;
cin>>n>>m;
for(int i=1;i<=m;i++)
{
cin>>task>>x1>>y1;
M[i].x=x1;
M[i].y=y1;
if(task==1) unite(radacina(x1),radacina(y1));
else if(task==2) schr(x1,y1);
}

return 0;
}