#include <fstream>
#include <map>
#include <unordered_map>

using namespace std;
ifstream cin("disjoint.in");
ofstream cout("disjoint.out");



int find(int x, unordered_map<int,int> &parent){
 	if(parent[x]==x)
 		return x;
 	return find(parent[x],parent);
}

void reunion(int x,int y,unordered_map<int,int> &parent){
  x=find(x,parent);
  y=find(y,parent);
  parent[x]=y;
}




int main(){
  unordered_map<int,int> parent;
  int n, m, i ,x, y, p;
  ios::sync_with_stdio(false);
  cin>>n>>m;
  for( i=1; i<=n; i++){
    parent[i]=i;
  }
  for(i=1;i<=m;i++){
   cin>>p>>x>>y;
   if(p==1){
   	reunion(x,y,parent);
   }
   else{
   	if(find(x,parent)==find(y,parent))
   		cout<<"DA"<<"\n";
   	else
   		cout<<"NU"<<"\n";

   }

  }



}