#include<stdio.h>
int h[100010],t[100010];
int find( int x)
{
	while(t[x]!=x)
		x=t[x];
	return x;
}

void unite (int x, int y)
{
	if(h[x]==h[y])
		{
			h[x]++;
			t[y]=x;
		}
	if(h[x]>h[y])
		t[y]=x;
	if(h[x]<h[y])
		t[x]=y;
}	
	
int main()
{
	freopen("disjoint.in","r",stdin);
	freopen("disjoint.out","w",stdout);
	int m,cod,x,y,i,n,tx,ty;
	scanf("%d%d",&n,&m);
	for(i=1;i<=n;i++)
		t[i]=i;
	for(i=1;i<=m;i++)
		{
			scanf("%d%d%d",&cod,&x,&y);
			if(cod==1)
				{
					tx=find(x);
					ty=find(y);
					unite(tx,ty);
				}
			else
				{
					tx=find(x); 
					ty=find(y);
					if(tx==ty) printf("DA\n");
					else	   printf("NU\n");
				}
		}
	return 0;
}