#include <bits/stdc++.h>

using namespace std;
ifstream fin ("disjoint.in");
ofstream fout ("disjoint.out");
int parinte[1000000];
int find_root (int x)
{
	while(parinte[x]!=x)
		x=parinte[x];
	return x;
}
void unionn (int x,int y)
{
	x=find_root(x);
	y=find_root(y);
	if(x!=y)
	{
		parinte[x]=y;
	}
}
int main ()
{
	int n,m,c,nr1,nr2;
	fin>>n>>m;
	for(int i=1;i<=n;i++)
		parinte[i]=i;
	for(int i=1;i<=m;i++)
	{
		fin>>c>>nr1>>nr2;
		if(c==1)
			unionn(nr1,nr2);
		else
		{
			if(find_root(nr1)==find_root(nr2))
				fout<<"DA\n";
			else
				fout<<"NU\n";
		}
	}
}