// http://infoarena.ro/problema/disjoint
#include <fstream>
using namespace std;

#define maxSize 100001

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

int father[maxSize];

void unite(int first,int second);
int findAndUpdate(int &node);

int main() {
	int number,operations;
	int type,first,second;

	in >> number >> operations;

	// initial fiecare nod este radacina
	// (pointeaza spre el insusi)
	for(int i=1;i<=number;i++)
		father[i] = i;

	for(int i=1;i<=operations;i++) {
		in >> type >> first >> second;

		switch(type) {
			case 1:
				unite(findAndUpdate(first),findAndUpdate(second));
				break;
			case 2:
				if(findAndUpdate(first) == findAndUpdate(second))
					out << "DA\n";
				else
					out << "NU\n";
				break;
		}
	}

	in.close();
	out.close();

	return (0);
}

void unite(int first,int second) {
	father[first] = second;
}

int findAndUpdate(int &node) {
	// daca s-a ajuns la radacina arborelui
	// (nodul pointeaza spre el insusi)
	if(father[node] == node)
		return node;
	else {
		// aplic compresia drumurilor
		// (actualizez cu radacina arborelui);
		father[node] = findAndUpdate(father[node]);
		return father[node];
	}
}