#include <iostream>
#include <fstream>
using namespace std;

int dad[100001];
int rang[100001];

int find(int nod) {
	if(dad[nod] == nod) {
		return nod;
	}
	return dad[nod] = find(dad[nod]);
}

int merge(int nod1, int nod2) {
   if(rang[nod1] > rang[nod2]) dad[nod2] = nod1;
   else dad[nod1] = nod2;
   if(rang[nod1] == rang[nod2]) ++rang[nod2];
}

int main()
{
    ifstream cin("disjoint.in");
    ofstream cout("disjoint.out");
    int n, m, x, y, tip;
    cin >> n >> m;
    for(int i = 1; i <= n; ++i)
      dad[i] = i, rang[i] = 1;
    for(int i = 1; i <= m; ++i) {
      cin >> tip >> x >> y;
      if(tip == 2) {
         if(find(x) == find(y)) cout << "DA" << '\n';
         else cout << "NU" << '\n';
      }
      else merge(find(x), find(y));
    }
    return 0;
}