#include<iostream>
#include<fstream>
using namespace std;

#define NMAX 100001

int p[NMAX],rang[NMAX];

int multime(int x)
{
	int r,y;
	r=x;
	while(p[r]!=r)
		r=p[r];
	while(p[x]!=x) {
		y=p[x];
		p[x]=r;
		x=y;
	}
	return r;
}

void reuneste(int x, int y)
{
	x=multime(x);
	y=multime(y);
	if(rang[x]>rang[y])
		p[y]=x;
	else p[x]=y;
	if(rang[x]==rang[y])
		rang[y]=rang[y]+rang[x];
}

int main ()
{
	int n,m,i,x,y,opt;
	ifstream f("disjoint.in");
	ofstream g("disjoint.out");
	f>>n>>m;
	for(i=1;i<=n;i++) {
		p[i]=i;
		rang[i]=1;
	}
	for(i=1;i<=m;i++) {
		f>>opt>>x>>y;
		if(opt==1)
			reuneste(x,y);
		else {
			if(multime(x)==multime(y))
				g<<"DA";
			else g<<"NU";
			g<<'\n';
		}
	}
	f.close();
	g.close();
	return 0;
}