#include <stdio.h>
#include <vector>
#define MAX 100005
using namespace std;
  
int n, m, i, set[MAX], size[MAX], type, x, y;
vector<int> l[MAX];
  
void MakeSet(int n){
  for(int i = 1; i <= n; i++){
    set[i] = i;
    l[i].push_back(i);
  }
}
  
void Merge(int x, int y){
  while(!l[x].empty()){
    int n = l[x].back();
    l[x].pop_back();
    set[n] = y;
    l[y].push_back(n);
  }
  size[y] += size[x];
  size[x] = 0;
}
  
void Union(int x, int y){
  int fx = set[x], fy = set[y];
  if(size[fx] < size[fy])
    Merge(fx, fy);
  else
    Merge(fy, fx);
}
  
int main(){
    freopen("disjoint.in", "r", stdin);
    freopen("disjoint.out", "w", stdout);
    scanf("%d%d", &n, &m);
    MakeSet(n);
    for(int i = 0; i < m; i++){
        scanf("%d%d%d", &type, &x, &y);
        if(type == 1)
            Union(x, y);
        else
            printf(set[x] == set[y] ? "DA\n" : "NU\n");
    }
    return 0;
}