#include <cstdio>

using namespace std;
int n,m,T[100005],rang[100005],i,c,x,y;

int multime(int nod)
{
    if(T[nod]!=nod)
        multime(T[nod]);
    else
        return T[nod];
}

void reuniune(int x,int y)
{
    x=multime(x);
    y=multime(y);
    if(x==y)
        return;
    else
    {
        if(rang[x]<rang[y])
            T[x]=y;
        else T[y]=x;
        if(rang[x]==rang[y])
            ++rang[x];

    }

}
int main()
{
    freopen("disjoint.in","r",stdin);
    freopen("disjoint.out","w",stdout);
    scanf("%d %d\n",&n,&m);

    for(i=1; i<=n; ++i)
    {
        T[i]=i;
        rang[i]=0;
    }
    for(i=1; i<=m; ++i)
    {
        scanf("%d %d %d\n",&c,&x,&y);
        if(c==1)
            reuniune(x,y);
        else
        {
            if(multime(y) == multime(x))
                printf("DA\n");
            else printf("NU\n");

        }
    }


    return 0;
}