#include <iostream>
#include <stdio.h>
#define NMax 100020
using namespace std;
int tata[NMax],rang[NMax],N,M;

int Find(int x)
{
    int radacina,y;
    for(radacina=x;tata[radacina]!=radacina;radacina=tata[radacina]);

    while(tata[x]!=x)
    {
        y=tata[x];
        tata[x]=radacina;
        x=y;
    }
    return radacina;
}

void Union(int x,int y)
{
    if(rang[x]>rang[y])
        tata[y]=x;
    else tata[x]=y;

    if(rang[x]==rang[y])
        rang[y]++;
}

int main()
{
    freopen("disjoint.in","r",stdin);
    freopen("disjoint.out","w",stdout);
    scanf("%d%d",&N,&M);
    for(int i=1;i<=N;i++)
    {
        tata[i]=i;
        rang[i]=1;
    }
    int op,y,x;
    for(int i=1;i<=M;i++)
    {
        scanf("%d%d%d",&op,&x,&y);
        if(op==2)
            if(Find(x)==Find(y))
                printf("DA\n");
            else
                printf("NU\n");
        else
        {
            Union(Find(x),Find(y));
        }
    }
}