#include<stdio.h>
int h[100005];
int t[100005];
int find(int x)
{
	while(t[x]!=x)
		x=t[x];
	return t[x];
}
void reunion(int x,int y)
{
	if(h[x]==h[y])
		{
			t[y]=x;
			h[x]++;
		}
	else
		if(h[x]>h[y])
			t[y]=x;
		else
			t[x]=y;
}
int main()
{
	freopen("disjoint.in","r",stdin);
	freopen("disjoint.out","w",stdout);
	int n,m,i,tx,ty,x,y,cod;
	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);
		tx=find(x);
		ty=find(y);
		if(cod==1)
			{
			if(tx!=ty)
				reunion(tx,ty);
			}
		else
			if(tx==ty)
				printf("DA\n");
			else
				printf("NU\n");
	}
	return 0;
}