#include<stdio.h>
#define MAX 100001
int m,n,x,y,cod,T[MAX],R[MAX];
void init()
{
	int i;
	for(i=1;i<=n;++i)
	{T[i] = i;R[i] = 1;}
}
void compress(int i,int rad)
{
	int var;
	for(;i != T[i];i=var)
	{
		var = T[i];
		T[i] = rad;
	}
}
int find(int x)
{
	int i = T[x];
	for(;i!=T[i];i=T[i]);
	compress(T[x], i);
	return i;
}
void unite(int x,int y)
{
	if(find(x)!=find(y));
	
	if(R[x]>=R[y])
	{
		T[T[y]] = T[T[x]];
		R[x] += R[y];
	}
	else
	{
		R[y] += R[x];
		T[T[x]] = T[T[y]];
	}
}
int main()
{
	FILE*f = fopen("disjoint.in","r");
	FILE*g = fopen("disjoint.out","w");
	fscanf(f,"%d%d",&n,&m);
	init();
	while(m--)
	{
		fscanf(f,"%d%d%d",&cod,&x,&y);
		if(cod == 2)
		{
			if(find(x) == find(y))fprintf(g,"DA\n");
			else fprintf(g,"NU\n");
		}
		else
		{
			unite(x,y);
		}
	}
	fclose(f);
	fclose(g);
	return 0;
}