#include <cstdio>
using namespace std;
const int NMAX = 100000;
int t[NMAX+5],h[NMAX+5];
int FindSet(int x)
{
	while(x!=t[x])
		x = t[x];
	return x;
}
void UnionSet(int x,int y)

{
	if(h[x]==h[y])
	{
		t[y]=x;
		h[x]++;
	}
	else
	if(h[x]>h[y])
		t[y]=x;
	else
		t[x]=y;
}
int main()
{
	freopen("disjoint.in","r",stdin);
	freopen("disjoint.out","w",stdout);
	int n,m,i,tx,ty,x,y,p;
	scanf("%d%d",&n,&m);
	for(i=1;i<=n;i++)
		t[i]=i;h[i]=1;
	for(i=1;i<=m;i++)
	{
		scanf("%d%d%d",&p,&x,&y);
		tx=FindSet(x);
		ty=FindSet(y);
		if(tx!=ty&&p==1)
			UnionSet(tx,ty);
        else
        if(p==2)
		{
			if(t[tx]==t[ty])
                printf("DA\n");
            else
                printf("NU\n");
		}
	}
    return 0;
}