#include<cstdio>
#include<algorithm>
using namespace std;
int n,i,j,k,viz[100005],m,x,y;
int find(int x)
{
	while (viz[x]!=0) x=viz[x];
	return x;
}

int main()
{
	freopen("disjoint.in","r",stdin);
	freopen("disjoint.out","w",stdout);
	scanf("%d %d",&n,&k);
	for (i=1;i<=k;i++)
	{
		scanf("%d %d %d",&m,&x,&y);
		if (m==1) 
		{
			if (find(x)>find(y)) viz[find(y)]=find(x);else viz[find(x)]=find(y);
		}else 
			if (m==2) if (find(x)==find(y)) printf("DA\n");else printf("NU\n");
	}
	return 0;
}