#include<stdio.h>
int t[100008],h[100009];
int findset(int x)
{
  while(t[x]!=x)
        x=t[x];
  return x;
}
void unionset(int x,int y)
{
    if(h[x]==h[y])
    {
     h[x]++;
     t[y]=x;
    }
    else
     if(h[x]<h[y])
         t[x]=y;
    else
        t[y]=x;

}
int main()
{

    freopen("disjoint.in","r",stdin);
    freopen("disjoint.out","w",stdout);

    int i,j,x,y,n,m;

    scanf("%d%d",&n,&m);
    for(i=1;i<=n;i++)
        t[i]=i;
    for(i=1;i<=m;i++)
    {
      scanf("%d%d%d",&j,&x,&y);
        if(j==1)
            unionset(findset(x),findset(y));
        else
            if(findset(x)==findset(y))
                printf("DA\n");
            else
                printf("NU\n");

    }

}