#include <fstream>
#include<algorithm>
#include<cmath>
#include<vector>
#include<string>
#include<unordered_map>
#include<map>
#include<climits>
using namespace std;
ifstream cin("disjoint.in");
ofstream cout("disjoint.out");
struct padcomp{
  vector<int>pad;
  padcomp(int n){
     pad.resize(n+1);
  }

  int rad(int a){ // aflu pt a carei radacina copacului care apartine
    if(pad[a]==0)return a;
    pad[a]=rad(pad[a]);
    return pad[a];
  }

  void join(int a,int b){
     a=rad(a);
     b=rad(b);
     if(a!=b)pad[a]=b;
  }
  bool intrab(int a,int b){
     return rad(a)==rad(b);
  }
};
int main()
{
    int n,m;
    cin>>n>>m;
    padcomp disjoint(n);
    for(int i=0;i<m;i++){
        int op,a,b;
        cin>>op>>a>>b;
        if(op==1)disjoint.join(a,b);
        else if(disjoint.intrab(a,b))cout<<"DA\n";
        else cout<<"NU\n";
    }
    return 0;
}