#include<stdio.h>
#define NMAX 100001
int t[NMAX],g[NMAX],n,m;

int find(int x,int y)
{
	while(t[x]!=x)
		x=t[x];
	while(t[y]!=y)
		y=t[y];
	if(x==y)
		return 1;
	return 0;
}
void uniune(int x,int y)
{
	if(g[x]>g[y])
		t[y]=x;
	else
		t[x]=y;
	if(g[x]==g[y])
		g[y]++;
}
int main()
{
	int i,cod,x,y;
	freopen("disjoint.in","r",stdin);
	freopen("disjoint.out","w",stdout);
	scanf("%d %d",&n,&m);

	for(i=1;i<=n;i++)
	{
		t[i]=i;
		g[i]=1;
	}
	for(;m;m--)
	{
		scanf("%d %d %d",&cod,&x,&y);
		if(cod==2)
		{
			if(find(x,y))
				printf("DA\n");
			else
				printf("NU\n");
		}
		else
		{
			if(!find(x,y))
				uniune(x,y);
		}
	}
	
	return 0;
}