#include <cstdio>
#include <vector>

using namespace std;

vector<int> parents;
vector<int> ranks;

void join(int a, int b) {
	if (ranks[a] > ranks[b])
		parents[b] = parents[a];
	else
		parents[a] = parents[b];

	if (ranks[a] == ranks[b])
		++ranks[b];
}


int get(int a) {
	int i, aux;
	for(i=a; parents[i] != i; i = parents[i]);

	while(parents[a] != a) {
		aux = parents[a];
		parents[a] = i;
		a = aux;
	}

	return i;
}



bool common(int a, int b) {
	return get(a) == get(b);
}


int main() {
	freopen("disjoint.in", "r", stdin);
	freopen("disjoint.out", "w", stdout);

	int n, m, a, b, c;

	scanf("%d%d", &n, &m);

	parents.resize(n+1);
	ranks.resize(n+1);
	for(int i=0; i<=n; ++i) {
		ranks[i] = 1;
		parents[i] = i;
	}

	for(int i=0; i<m; ++i) {
		scanf("%d%d%d", &a, &b, &c);
		if (a == 1)
			join(b, c);
		else
			if (common(b, c))
				printf("DA\n");
			else
				printf("NU\n");
	}

	return 0;
}