#include <fstream>
using namespace std;
int n,m,t[100001];
int root(int n)
{
	while(t[n])
		n=t[n];
	return n;
}
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int main()
{
	int o,a,b;
	fin>>n>>m;
	while(m--)
	{
		fin>>o>>a>>b;
		if(o==1)
			t[root(b)]=root(a);
		else if(root(a)==root(b))
			fout<<"DA\n";
		else
			fout<<"NU\n";
	}
	return 0;
}