#include <stdio.h>
#define MAXN 100002

int root[MAXN];

int find(int key)
{
	if (root[key] == key)
	{
		return key;
	}
	else
	{
		root[key] = find(root[key]);
		return root[key];
	}
}

int main()
{
	freopen("disjoint.in","r",stdin);
	freopen("disjoint.out","w",stdout);

	int n,m,i,x,y,cod;
	scanf("%d%d",&n,&m);

	for (i=1;i<=n;i++)
	{
		root[i] = i;
	}

	for (i=0;i<m;i++)
	{
		scanf("%d%d%d",&cod,&x,&y);
		if (cod == 1)
		{
			root[x] = find(root[y]);
		}
		else
		{
			if (find(root[x]) == find(root[y]))
			{
				printf("DA\n");
			}
			else
			{
				printf("NU\n");
			}
		}
	}

	return 0;
}