#include <cstdio>
using namespace std;
int father[100001],rang[100001];
int i,j,n,t,x,y,c;
int query(int nod)
{
	if(father[nod]==nod){return nod;}
	else{
		father[nod]=query(father[nod]);
		rang[nod]=rang[father[nod]]+1;
		return father[nod];
		}
}
int main()
{
	freopen("disjoint.in","r",stdin);
	freopen("disjoint.out","w",stdout);
	scanf("%d%d",&n,&t);
	for(i=1;i<=n;i++){father[i]=i;}
	while(t--)
	{
		scanf("%d%d%d",&c,&x,&y);
		if(c==1){
			x=query(x);
			y=query(y);
			if(rang[x]>rang[y]){father[y]=x;rang[y]++;}
			else{father[x]=y;rang[x]++;}
				}
		if(c==2){
			if(query(x)==query(y)){printf("DA\n");}
			else{printf("NU\n");}
				}
	}
return 0;
}