#include<cstdio>
using namespace std;
const int nmax = 100005;
int n,m,i,x,y,f[nmax];
int find(int x)
{
    if(f[x]!=x) f[x]=find(f[x]);
    return f[x];
}
void unite(int x,int y)
{
    f[x]=y;
}
int main()
{
	freopen("disjoint.in","r",stdin);
	freopen("disjoint.out","w",stdout);
	scanf("%d%d",&n,&m);
	for(i=1;i<=n;i++) f[i]=i;
	for(;m;m--)
	{
	    scanf("%d%d%d",&i,&x,&y);
	    if(i==1) unite(find(x),find(y));
	    else (find(x)==find(y))?printf("DA\n"):printf("NU\n");
	}
	return 0;
}