#include<stdio.h>
#include<vector>
int parent[100100];
int N,M,x,y,z;

int root(int k)
{
    int ret=k;
    while(parent[ret])
    {
        ret=parent[ret];
    }
    return ret;
}

void compress(int k)
{
    int temp=k;
    int r=root(k);
    while(parent[temp])
    {
        int temp1=parent[temp];
        parent[temp]=r;
        temp=temp1;
    }
}



int main()
{
    freopen("disjoint.in","r",stdin);
    freopen("disjoint.out","w",stdout);
    scanf("%d%d",&N,&M);

    for(int i=1;i<=M;++i)
    {
        scanf("%d%d%d",&x,&y,&z);
        if(x==2)
        {
            if(root(y)==root(z))
               printf("DA\n");
            else
                printf("NU\n");
            compress(y);
            compress(z);
        }
        if(x==1)
        {
            int d=root(y);
            int e=root(z);
            parent[d]=e;
           /* for(int j=1;j<=N;++j)
            {
                printf("%d %d\n",j,parent[j]);
            }
            printf("\n");*/
        }
    }
    return 0;

}