#include<fstream>
using namespace std;
#define nm 100001
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int n,t[nm],h[nm];
int Find(int x){
	while(t[x])
		x=t[x];
	return x;
}
void Union(int x,int y){
	int tx=Find(x),ty=Find(y);
	if(h[tx]<h[ty])
		t[tx]=ty;
	else{
		t[ty]=tx;
		if(h[ty]==h[ty])
			h[tx]++;
	}
}
int main(){
	int m,cod,x,y;
	fin>>n>>m;
	while(n--){
		fin>>cod>>x>>y;
		if(cod==1)
			Union(x,y);
		else{
			if(Find(x)==Find(y))
				fout<<"DA\n";
			else
				fout<<"NU\n";
		}
	}
	return 0;
}