#include<stdio.h>
int t[100010],h[100010];
int find(int x)
{
	for( ;t[x]!=x;x=t[x]);
	
return x;
}
void Union(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);
	long n,m,i,j,cod,x,y,tx,ty;
	scanf("%ld%ld",&n,&m);
	for(i=1;i<=n;i++)
		t[i]=i;
	for(i=1;i<=m;i++)
	{
		scanf("%ld%ld%ld",&cod,&x,&y);
		tx=find(x);
		ty=find(y);
		if(cod==1)
		{
			if(tx!=ty)
				Union(tx,ty);
		}
		else
		{
			if(tx!=ty)
				printf("NU\n");
			else
				printf("DA\n");
		}
	}
	return 0;
}