#include <stdio.h>

#define MAXN 100000

int t[MAXN + 1], n, m;

int init() { for(int i = 1; i <= n; ++i) t[i] = i; }

int reprezentant(int);

void reuneste(int ra, int rb) { t[rb] = ra; }

int reprezentant(int nod)
{
	while(t[nod] != nod) nod = t[nod];
	return nod;
}

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

	scanf("%d%d", &n, &m);

	init();

	while(m--)
	{
		scanf("%d%d%d", &op, &x, &y);
		if(op == 1) reuneste(reprezentant(x), reprezentant(y));
		else
		{
			if(reprezentant(x) == reprezentant(y)) printf("DA\n");
			else printf("NU\n");
		}
	}

	return 0;
}