#include<fstream>
#include<algorithm>
using namespace std;

int a[100005],r[100005],n,m,i,op,x,y;

int find(int x) {
   int i,b;
   for(i=x;a[i]!=i;i=a[i]);
   
   for(;a[x]!=x;)
   b=a[x],a[x]=i,x=b; 
 return i;  
}

void unite(int x,int y) {
   if(r[x]>r[y]) a[y]=x; else a[x]=y;
   if(r[x]==r[y]) ++r[y];  
}

int main()
{
  ifstream cin("disjoint.in");
  ofstream cout("disjoint.out");  
  
  cin>>n>>m;
  for(i=1;i<=n;++i) a[i]=i,r[i]=1;
  
  while(m--)
  {
    cin>>op>>x>>y;        
    if(op==1) unite(find(x),find(y));
    else if(find(x)==find(y)) cout<<"DA"<<'\n';
         else cout<<"NU"<<'\n'; 
  }
    
    
 return 0;   
}