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