#include<fstream>
#define max_n 100005
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int comp[max_n];
int n,m;
int grupa(int i) 
{
	if (comp[i] == i) 
		return i;
	comp[i] = grupa(comp[i]);
	return comp[i]; 
}   
void reuniune(int i,int j) 
{
	comp[grupa(i)] = grupa(j);  
}
int tip,x,y;
int main()
{
	f>>n>>m;
	for(int i=1;i<=n;i++)
		comp[i] = i;
	for(int i=1;i<=m;i++)
	{
		f>>tip>>x>>y;
		if(tip == 1)
		{
			reuniune(x,y);
		}
		else
		{
			if(grupa(x) == grupa(y))
				g<<"DA\n";
			else
				g<<"NU\n";
		}
	}
	return 0;
}