#include<cstdio>

using namespace std;

int grad[100003],fadar[10003],x,y,n,m,op,i;

int iunait(int x)
{
    if(x!=fadar[x])
    {
        fadar[x]=iunait(fadar[x]);
    }
    return fadar[x];
}

void riiunait(int x,int y)
{
    x=iunait(x);
    y=iunait(y);
    if(grad[x]>grad[y])
    {
        fadar[y]=x;
    }
    else
    {
        fadar[x]=y;
    }
    if(grad[x]==grad[y])
    {
        grad[y]++;
    }
}

int main()
{
    freopen("disjoint.in","r",stdin);
    freopen("disjoint.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(i=1;i<=n;i++)
    {
        grad[i]=0;
        fadar[i]=i;
    }
    for(i=1;i<=m;i++)
    {
        scanf("%d%d%d",&op,&x,&y);
        if(op==1)
        {
            riiunait(x,y);
        }
        if(op==2)
        {
            if(iunait(x)==iunait(y))
            {
                printf("DA\n");
            }
            else
            {
                printf("NU\n");
            }
        }
    }
}