#include<fstream>
using namespace std;
int n,m,i,j,c[100001],x,y,t;

int find(int x)
{
	int r,y;
	
	r=c[x];
	while(c[x]!=x)
		x=c[x];
	
	while(c[x]!=x)
	{
		y=c[x];
		c[x]=r;
		x=y;
	}
	
}
		
int main()
{
	freopen("disjoint.in","r",stdin);
	freopen("disjoint.out","w",stdout);
	
	scanf("%d%d",&n,&m);

	for(i=1;i<=n;++i)
		c[i]=i;
	
	while(m)
	{
		--m;
		scanf("%d%d%d",&t,&x,&y);
		
		if(t==2)
		{
			if(find(x)==find(y))
				printf("DA\n");
			else
			printf("NU\n");
		}
		
		if(t==1)
		{
			if(c[x]<c[y])
				c[y]=c[x];
			else
				c[x]=c[y];
		}
	}

	return 0;
}