#include<fstream>
#define INF 2<<32-1
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int radacina,tata[100001],rang[100001],n,m,r1,r2,i,tip,x,y;
int find(int x)
{
	if(tata[x]!=INF)
	{
		find(tata[x]);
		tata[x]=radacina;
	}
	else
		radacina=x;
	return radacina;
}
void unix(int x,int y)
{
	if(rang[x]==rang[y])
	{
		rang[x]++;
		tata[y]=x;
	}
	else
		if(rang[x]<rang[y])
			tata[x]=y;
		else
			tata[y]=x;
}
int main()
{
	fin>>n>>m;
	for(i=1;i<=m;i++)
	{
		fin>>tip>>x>>y;
		r1=find(x);r2=find(y);
		if(!(tip-1))
		{
			if(r1!=r2)
				unix(r1,r2);
		}
		else
		{
			if(r1!=r2)
				fout<<"NU\n";
			else
				fout<<"DA\n";
		}
	}
	return 0;
}