#include <fstream>

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


const int MAXNM = 100001;

int parent[MAXNM];
int n, m;

int root(int x) {
	if (x == parent[x])
		return x;
	int p = root(parent[x]);
	parent[x] = p;
	return p;
}

int main() {
	fin >> n >> m;
	int p, x, y;
	for (int i = 0; i < m; i++) {
		fin >> p >> x >> y;
		if (p == 2) {
			int parent1 = root(x), parent2 = root(y);
			fout << (parent1 == parent2 ? "DA" : "NU");
		}
		else {
			parent[root(y)] = x;
		}
	}
	return 0;
}