#include <fstream>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
#define dim 100005
int t[dim], r[dim];
int n, m;

void read()
{
	fin>>n >>m;
	for(int i=1;i<=n;++i)
		t[i]=i;
}
	
int find(int x)
{
	if(x!=t[x])
		t[x]=find(t[x]);
	return t[x];
}

inline void unite(int x, int y)
{
	if(r[x]<r[y])
		t[x]=y;
	else
		t[y]=x;
	if(r[x]==r[y])
		++r[x];
}

void solve()
{
	int tip, x, y,i;
	for(i=1;i<=m;++i)	
	{
		fin>>tip >>x >>y;
		if(tip==1)
			unite( find(x),find(y) );
		else
			if(find(x)==find(y))
				fout<<"DA" <<'\n';
			else
				fout<<"NU" <<'\n';
	}
}

int main()
{
	read();
	solve();
	
	return 0;
}