#include <fstream>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int tata[100005], n, m,h[100005],op,x,y;
int Find(int k)
{
	int x = k;
	while (tata[k])
		k = tata[k];
	if (x != k)
	{
		while (tata[x] != k)
		{
			int aux = tata[x];
			tata[x] = k;
			x = aux;
		}
	}
	return k;
}
void Union(int x, int y)
{
	x = Find(x); 
	y = Find(y);
	if (h[x] < h[y])
		tata[x] = y;
	else if(h[x]>h[y])
		tata[y] = x;
	else
	{
		tata[x] = y;
		h[y]++;
	}
}
int main()
{
	int i;
	fin >> n >> m;
	for(i=1;i<=m;i++)
	{
		fin >> op>>x>>y;
		if (op == 1) Union(x, y);
		else
		{
			if (Find(x) == Find(y)) fout << "DA\n";
			else fout << "NU\n";
		}
	}
	return 0;
}