#include <fstream>
std::ifstream in("disjoint.in");
std::ofstream ut("disjoint.out");
int n,m,t[100001];
int root(int n){
 while(t[n]){n=t[n];}
 return n;
}
main(){
 int o,a,b;
 in>>n>>m;
 while(m--){
  in>>o>>a>>b;
  if(o==1) t[root(b)]=root(a);
  else if(root(a)==root(b)) ut<<"DA\n";
  else ut<<"NU\n";
 }
}