#include<stdio.h>

int t[100010],h[100010];

int find(int x)
{
for(;t[x]!=x;x=t[x]);
return x;
}

void UnIn(int x,int y)
{
if(h[x]>h[y])
	t[y]=x;
else
if(h[x]==h[y])
	{
	h[x]++;
	t[y]=x;
	}
else
	t[x]=y;
}

int main()
{
freopen("disjoint.in","r",stdin);
freopen("disjoint.out","w",stdout);
int n,m,i,p,x,y,rx,ry;
scanf("%d%d",&n,&m);
for(i=1;i<=n;i++)
	t[i]=i;
for(i=1;i<=m;i++)
	{
	scanf("%d%d%d",&p,&x,&y);
	rx=find(x);
	ry=find(y);
	if(p==1)
		UnIn(rx,ry);
	else
	if(p==2)
		{
		
		if(rx==ry)
			printf("DA\n");
		else
			printf("NU\n");
		}
	}
	
return 0;
}