#include <bits/stdc++.h>
using namespace std;

#define pb push_back
#define mp make_pair
#define dbg(x) cout << #x <<": " << x << "\n";
using ll = long long;

const string myf = "disjoint";
ifstream fin(myf + ".in");
ofstream fout(myf + ".out");

// const  int mod = 1999999973;

int n, m;
int op, x, y;
int t[100001];

int find(int x) {
	int rx = x, y;
	while (t[rx] != rx)
		rx = t[rx];
	while (t[x] != rx) {
		y = t[x];
		t[x] = rx;
		x = y;
	}
	return rx;
}

int uni(int x, int y) {
	t[y] = x;
}

int main() {

	fin >> n >> m;
	for (int i = 1; i <= n; ++i)
		t[i] = i;
	while (m--) {
		fin >> op >> x >> y;
		if (op == 1) {
			uni(find(x), find(y));
		}
		else {
			if (find(x) == find(y))
				fout << "DA\n";
			else fout << "NU\n";
		}
	}


	fin.close();
	fout.close();
	return 0;
}