#include <iostream>
#include <fstream>

using namespace std;

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

const int NMAX = 100005;
int n, m;
int tata[NMAX], rang[NMAX];

int radacina(int x) {
	int r = x;	// parcurg arborele in sus pana ajung la radacina
	while (tata[r] != r)
		r = tata[r];

	int y;
	while (tata[x] != x) {
		y = tata[x];
		tata[x] = r;
		x = y;
	}

	return r;
}

void reuniune(int x, int y) {
	int radacinaX = radacina(x);
	int radacinaY = radacina(y);

	if (rang[radacinaX] > rang[radacinaY])	// unesc arborele cu rangul mai mic de cel cu rang mai mare
		tata[radacinaY] = radacinaX;
	else 
		tata[radacinaX] = radacinaY;
	
	if (rang[radacinaX] == rang[radacinaY])
		rang[radacinaY]++;
}

int main() {
	fin >> n >> m;
	for (int i = 1; i <= n; i++) {
		tata[i] = i;
		rang[i] = 1;
	}

	for (int i = 0; i < m; i++) {
		int cod, x, y;
		fin >> cod >> x >> y;
		if (cod == 1) {
			reuniune(x, y);
		}
		else {
			if (radacina(x) == radacina(y))
				fout << "DA" << endl;
			else 
				fout << "NU" << endl;
		}
	}
}