#define DM 100001
#include <fstream>
using namespace std;

ifstream fi ("disjoint.in");
ofstream fo ("disjoint.out");
int p[DM], o, n, m, a, b;

int findset (int x)
{
	if (p[x] == x)
		return x;
	return p[x] = findset(p[x]);
}

void mergeset (int x, int y) {
	p[y] = x;
}

int main ()
{
	fi >> n >> m;
	for (int i = 1; i <= n; ++i)
		p[i] = i;
	for (int i = 1; i <= m; ++i)
	{
		fi >> o >> a >> b;
		if (o == 2)
			if (findset(a) == findset(b))
				fo << "DA\n";
			else
				fo << "NU\n";
		else
		{
			mergeset(findset(b), findset(a));
		}
	}
	return 0;
}