#include <iostream>
#include <stdio.h>
using namespace std;

#define MAX_N 100005

struct UF_Node {
  int head = -1;
  int siz = 1;
};
UF_Node UF[MAX_N];

int root(int pos) {
  return (UF[pos].head == -1) ? pos : UF[pos].head = root(UF[pos].head);
}

void unite(int pos1, int pos2) {
  pos1 = root(pos1);
  pos2 = root(pos2);

  if (UF[pos2].siz < UF[pos1].siz)
    std::swap(pos1, pos2);

  UF[pos1].head = pos2;
  UF[pos2].siz += UF[pos1].siz;
}

bool check(int pos1, int pos2) {
  return root(pos1) == root(pos2);
}

int main() {
  FILE *fin, *fout;
  int n, m;
  int q, a, b;
  int i;

  fin = fopen("disjoint.in", "r");

  fout = fopen("disjoint.out", "w");

  fscanf(fin, "%d%d", &n, &m);
  for (i = 0; i < m; i++) {
    fscanf(fin, "%d", &q);
    fscanf(fin, "%d", &a);
    fscanf(fin, "%d", &b);

    if (q == 1)
      unite(a, b);
    else
      fprintf(fout, "%s\n", (check(a, b) == 1 ? "DA" : "NU"));
  }

  fclose(fin);

  fclose(fout);

  return 0;
}