#include<stdio.h>
using namespace std;
FILE *f,*g;
int n,m,t[100002],h[100002];

int cauta(int x)
{
	int i,j;
	for(i=x;t[i]!=0;i=t[i]);
	
	for(j=x;t[j]!=0;j=t[j])
		t[j]=i;
	
	return i;
}

void comb(int x,int y)
{
	if(h[x]>h[y])
		t[y]=x;
	else
		t[x]=y;
	
	if(h[x]==h[y])
		h[y]++;
}

int main()
{
	int i,tip,x,y;
	f=fopen("disjoint.in","rt");
	g=fopen("disjoint.out","wt");
	fscanf(f,"%d %d",&n,&m);
	for(i=1;i<=n;i++)
		h[i]=1;
	for(i=1;i<=m;i++)
	{
		fscanf(f,"%d %d %d",&tip,&x,&y);
		if(tip==2)
			if(cauta(x)==cauta(y))
				fprintf(g,"DA\n");
			else
				fprintf(g,"NU\n");
		else
			comb(cauta(x),cauta(y));
	}
	fclose(f);
	fclose(g);
	return 0;
}