#include <fstream>
using namespace std;

ifstream fin("disjoint.in");
ofstream fout("disjoint.out");

#define nmax 100001

int i, n, m;
int op, a, b;

int t[nmax];

inline int find(int u) {
	if (t[u] != u) t[u] = find(t[u]);
	return t[u];
}

int main() {
	fin >> n >> m;
	for (i = 1; i <= n; ++i) t[i] = i;
	for (i = 1; i <= m; ++i) {
		fin >> op >> a >> b;
		a = find(a);
		b = find(b);
		if (op == 1)
			t[a] = b;
		if (op == 2) {
			if (a != b) 
				fout << "NU\n";
			else
				fout << "DA\n";
		}
	}
	return 0;
}