#include <bits/stdc++.h>
#define ll long long

using namespace std;

//ifstream in("tst.in");
ifstream in("disjoint.in");
ofstream out("disjoint.out");

int n, m, c, x, y, dad[100100];

int find(int p){
	return (p == dad[p] ? p : dad[p] = find(dad[p]));
}

void join(int x, int y){
	dad[find(x)] = find(y);
}

int main(){
	in >> n >> m;
	for(int i = 1; i <= n; i++)
		dad[i] = i;
	while(m--){
		in >> c >> x >> y;
		if(c - 1)
			out << (find(x) == find(y) ? "DA\n" : "NU\n");
		else join(x, y);
	}
	return 0; 
}