#include <stdio.h>

int r[100002];



int find(int x)
{
	if (r[x] == x)
	{
		return x;
	}
	else
	{
		r[x] = find(r[x]);
	}
}

inline void merge(int x,int y)
{
	r[y] = find(r[x]);
}

int main()
{
	freopen("disjoint.in","r",stdin);
	freopen("disjoint.out","w",stdout);
	int n,m,q,i,x,y;

	scanf("%d%d",&n,&m);
	for (i=1;i<=n;i++)
	{
		r[i] = i;
	}
	
	for (i=0;i<m;i++)
	{
		scanf("%d%d%d",&q,&x,&y);
		switch (q)
		{
		case 1:
			merge(x,y);
			break;
		case 2:
			if (find(x) == find(y))
			{
				printf("DA\n");
			}
			else
			{
				printf("NU\n");
			}
			break;
		}
	}

	return 0;
}