#include <iostream>
#include <fstream>

using namespace std;

ifstream fin("disjoint.in");
ofstream fout("disjoint.out");

const int NMAX = 100005;

int n, m;
int t[NMAX], h[NMAX];

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

int findSet(int x)
{
	int xi, ta;
	xi = x;
	while (x != t[x])
		x = t[x];
	while (xi != x)
	{
		ta = xi;
		xi = t[xi];
		t[ta] = x;
	}
	return x;
}

void uniteSet(int x, int y)
{
	x = findSet(x);
	y = findSet(y);
	if (x == y) return;
	if (h[x] == h[y])
	{
		t[y] = x;
		h[x]++;
	}
	else if (h[x] > h[y])
		t[y] = x;
	else
		t[x] = y;
}

int main()
{
	fin >> n >> m;
	init();
	int tip, x, y;
	while (m--)
	{
		fin >> tip >> x >> y;
		if (tip == 1)
			uniteSet(x, y);
		else
		{
			bool ok = (findSet(x) == findSet(y));
			if (ok) fout << "DA\n";
			else fout << "NU\n";
		}
	}
	return 0;
}