#include <fstream>
using namespace std;

#define maxn 100001
int t[maxn],n;

int root(int k){
	while(t[k])
		k=t[k];
	return k;}

int main(){
	ifstream f("disjoint.in");
	ofstream g("disjoint.out");
	int i,m,o,x,y;
	f>>n>>m;
	for(i=1;i<=m;i++){
		f>>o>>x>>y;
		if(o==2)
			if(root(x)==root(y))
				g<<"DA\n";
			else g<<"NU\n";
		if(o==1)
			t[root(y)]=x;}
	f.close();
	g.close();
	return 0;}