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