#include<fstream>
#define MAX 100001
using namespace std;
int T[MAX],R[MAX],N,M;
void compress(int x,int father)
{
	int aux;
	while(T[x])
	{
		aux = x;
		x = T[x];
		T[aux] = father;
	}
}
void reunion(int x,int y)
{
	if(R[x]>=R[y])
	{
		T[y] = x;
		R[x] += R[y];
	}
	else
	{
		T[x] = y;
		R[y] += R[x];
	}
}
int find(int x)
{
	int init = x;
	while(T[x])
		x = T[x];
	compress(init,x);
	return x;
}
int main()
{
	ifstream f("disjoint.in");
	f>>N>>M;
	int x,y,c,i;
	for(i=1;i<=N;++i)
		R[i]=1;
	ofstream g("disjoint.out");
	while(M--)
	{
		f>>c>>x>>y;
		if(c==1)
			if(find(x)!=find(y)reunion(find(x),find(y));
		else if(find(x) == find(y))g<<"DA\n";
			 else g<<"NU\n";
	}
	f.close();
	g.close();
	return 0;
}