#include<stdio.h>
int T[100002],N,M,i,t,y,x;
int tt(int x)
{
	while (x!=T[x]) x=T[x];
	return x;
}
int main()
{
	freopen("disjoint.in","r",stdin);
	freopen("disjoint.out","w",stdout);
	scanf("%d%d",&N,&M);
	for (i=1;i<=N;i++) T[i]=i;
	for (i=1;i<=M;i++)
	{
		scanf("%d%d%d",&t,&x,&y);
		if (t==1) T[x]=y;
		else if (tt(x)==tt(y)) printf("DA\n");
		else printf("NU\n");
	}
}