#include<stdio.h>
#define NM 100001
int n;
struct set{
	int parent;
	};
set v[NM+1];

void Makeset(int x){
v[x].parent=x;
}
int Find(int x){
if(v[x].parent==x) return x;
else return Find(v[x].parent);
}
void Union(int x,int y){
int xroot=Find(x),yroot=Find(y);
v[xroot].parent=yroot;
}

int main(){
freopen("disjoint.in","r",stdin);
freopen("disjoint.out","w",stdout);
int i,m,t,x,y,xr,yr;
scanf("%d%d",&n,&m);
i=1;
while(i<=n) Makeset(i++);
while(m--){
	scanf("%d%d%d",&t,&x,&y);
	switch(t){
		case 1:Union(x,y);
			   break;
		case 2:xr=Find(x);
			   yr=Find(y);
			   if(xr==yr) printf("DA\n");
			   else printf("NU\n");
			   break;
		}
	}
return 0;
}