#include <iostream>

using namespace std;
int n,m,tata[100005],h[100005];



int cauta(int x)
{
    int rx=x;
    while(tata[rx]!=rx)
    {
        rx=tata[rx];
    }
    int y=x;
    while(tata[y]!=y)
    {
        int aux=tata[y];
        tata[y]=rx;
        y=aux;
    }
    return rx;
}



void reunion(int x,int y)
{
    int rx=cauta(x);
    int ry=cauta(y);
    if(ry!=rx)
    {
        if(h[rx]<h[ry])
        {
            tata[rx]=ry;
        }
        else
        {
            tata[ry]=rx;
            if(h[rx]==h[ry])
                h[rx]++;
        }
    }
}





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;
        h[i]=0;
    }
    for(int i=1;i<=m;i++)
    {
        int tip,x,y;
        scanf("%d%d%d",&tip,&x,&y);
        if(tip==1)
        {
            reunion(x,y);
        }
        else
        {
            if(cauta(x)==cauta(y))
                printf("DA\n");
            else
                printf("NU\n");
        }
    }
    return 0;
}