#include <stdio.h>

int arb[100020], rang[100020];

int find(int x)
{
	int it, y;

	for(it = x ; arb[it] != it ; it = arb[it]);

	while(arb[x] != x){
		y = arb[x];
		arb[x] = it;
		x = y;
	}

	return it;
}

void my_union(int x, int y)
{
	if(rang[x] > rang[y]){
		arb[y] = x;
	}
	else{
		arb[x] = y;
	}

	if(rang[x] == rang[y]){
		++rang[y];
	}
}

int main()
{
	int n, m, i, x, y, comm;
	FILE *in, *out;

	in = fopen("disjoint.in", "r");
	out = fopen("disjoint.out", "w");

	fscanf(in, "%d%d", &n, &m);
	//printf("%d %d\n", n, m);
	
	for(i = 1 ; i <= n ; ++i){
		arb[i] = i;
		rang[i] = 1;
	}

	for(i = 0 ; i < m ; ++i){
		fscanf(in, "%d%d%d", &comm, &x, &y);
		if(comm == 1){
			my_union(find(x), find(y));
		}
		else{
			if(find(x) == find(y)) fprintf(out, "DA\n");
			else fprintf(out, "NU\n");
		}
	}

	fclose(in);
	fclose(out);

	return 0;
}