#include<fstream>
#define NMAx 100100
using namespace std;
int n,T[NMAx];

int dfs(int nod) {
	if(T[nod]!=nod)
		T[nod]=dfs(T[nod]);
	return T[nod];
}
int main() {
	int i,x,y,cod,m;
	ifstream in("disjoint.in");
	ofstream out("disjoint.out");
	in>>n>>m;
	for(i=1;i<=n;T[i++]=i);
	for(i=0;i<m;i++) {
		in>>cod>>x>>y;
		if(cod==1)
			T[dfs(x)]=dfs(y);
		else
		if(dfs(x)==dfs(y))
			out<<"DA\n";
		else
			out<<"NU\n";
		}
	in.close();
	out.close();
	return 0;
}