#include <iostream>
#include <cstdio>
using namespace std;
int rad[100010],h[100010];
/*
int find(int x)
{
    if(x==rad[x])
        return x;
    else
        return find(rad[x]);
}*/
int find(int x)
{
    int R, y;

    //merg in sus pe arbore pana gasesc un nod care pointeaza catre el insusi
    for (R = x; rad[R] != R; R = rad[R]);

    //aplic compresia drumurilor
    for (; rad[x] != x;)
    {
        y = rad[x];
        rad[x] = R;
        x = y;
    }
    return R;
}
void Union(int x,int y)
{
    if(h[x]==h[y])
    {
        h[x]++;
        rad[x]=y;
    }
    else
        if(h[x]>h[y])
            rad[x]=y;
    else
        rad[y]=x;
}

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

    int i,n,m,x,y,tx,ty,cod;
    scanf("%d%d",&n,&m);
    for(i=1;i<=n;i++)
        rad[i]=i;
    for(i=1;i<=m;i++)
    {
        scanf("%d%d%d",&cod,&x,&y);
        if(cod==1)
        {
                tx=find(x);
                ty=find(y);
                Union(tx,ty);
            }
            else
            {
                tx=find(x);
                ty=find(y);
                if(tx!=ty)
                    printf("NU\n");
                    else
                        printf("DA\n");
                }

    }
    return 0;
}