#include <stdio.h>

using namespace std;

int t[100002];
int r[100002];

int query(int x)
{
    while(t[x]!=x)
        x=t[x];
    return x;
}

void join(int x, int y)
{
    int i;
    t[y]=x;
}

int main()
{
    freopen("disjoint.in","r",stdin);
    freopen("disjoint.out","w",stdout);
    int n,m,i,x,y,a,b,j;
    scanf("%d%d",&n,&m);
    for(i=1;i<=n;i++)
        t[i]=i;
    for(i=0;i<m;i++)
    {
        scanf("%d%d%d",&j,&x,&y);
        if(j==1)
        {
            a=query(x);
            b=query(y);
            if(r[a]>=r[b])
                join(a,b);
            else
                join(b,a);
            if(r[a]==r[b])
                r[a]++;
        }
        else
        {
            if(query(x)==query(y))
                printf("DA\n");
            else printf("NU\n");
        }
    }

    return 0;
}