#include <fstream>

using namespace std;

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

#define DIM 100001

int p[DIM], r[DIM];

int n, m;
int op, x, y;

int Findset(int);
void Union(int, int);


int main()
{
	fin >> n >> m;

	for (int i = 1; i <= n; ++i)
	{
		p[i] = i;
		r[i] = 1;
	}

	while (m--)
	{
		fin >> op >> x >> y;
		if (op == 1)
			Union(x, y);
		else
		{
			if (Findset(x) == Findset(y))
				fout << "DA\n";
			else
				fout << "NU\n";
		}
	}
	fin.close();
	fout.close();
    return 0;
}

void Union(int x, int y)
{
	int px = Findset(x);
	int py = Findset(y);

	if (r[px] > r[py])
		p[py] = y;
	else
		p[py] = x;

	if (r[px] == r[py])
		r[py]++;
}

int Findset(int i)
{
	if (i == p[i])
		return i;
	return p[i] = Findset(p[i]);
}