#include<cstdio>
using namespace std;
int sef[100001],h[100001];
int find(int x)
{
	if(sef[x]==x)
		return x;
	sef[x]=find(sef[x]);
	return sef[x];
}
void union1(int x,int y)
{
	int i,j;
	i=find(x);
	j=find(y);
	if(h[i]>h[j])
		sef[j]=i;
	else
		if(h[i]<h[j])
			sef[i]=j;
		else
		{
			sef[j]=i;
			h[i]++;
		}
}
int main()
{
	freopen("disjoint.in","r",stdin);
	freopen("disjoint.out","w",stdout);
	int n,q,i,tip,x,y;
	scanf("%d%d",&n,&q);
	for(i=1;i<=n;i++)
	{
		sef[i]=i;
		h[i]=1;
	}
	for(i=1;i<=q;i++)
	{
		scanf("%d%d%d",&tip,&x,&y);
		if(tip==1)
		{
			union1(x,y);
		}
		else
		{
			if(find(x)==find(y))
				printf("DA\n");
			else
				printf("NU\n");
		}
	}
	return 0;
}