#include <bits/stdc++.h>
using namespace std;
int n,m,p[100001];

ifstream in("disjoint.in");
ofstream out("disjoint.out");

int parent(int n)
{
	while(p[n])
		n=p[n];
	return n;
}

int main()
{
	int o,x,y;
	in>>n>>m;
	while(m--)
	{
		in>>o>>x>>y;
		if(o==1)
			p[parent(y)]=parent(x);
		else if(parent(x)==parent(y)) out<<"DA\n";
		else out<<"NU\n";
	}
	return 0;
}