#include <cstdio>
using namespace std;

int dad[100100];
int h[100100];

int root(int x)
{
    int r;
    for(r=dad[x];r!=dad[r];r=dad[r]);

    /*while(x!=dad[x])
    {
        int y=dad[x];
        dad[x]=r;
        x=y;
    }*/

    return r;
}

void fuse(int x,int y)
{
    if(h[x]>h[y])
    {
        dad[y]=x;
    }
    else if(h[x]<h[y])
    {
        dad[x]=y;
    }
    else
    {
        dad[y]=x;
        h[x]++;
    }
}

int main()
{
    freopen("disjoint.in","r",stdin);
    freopen("disjoint.out","w",stdout);
    int n,m;
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++)
    {
        dad[i]=i;
        h[i]=1;
    }
    for(int i=1;i<=m;i++)
    {
        int t,x,y;
        scanf("%d%d%d",&t,&x,&y);
        if(t==1)
        {
            fuse(root(x),root(y));
        }
        else
        {
            if(root(x)==root(y))
                printf("DA\n");
            else
                printf("NU\n");
        }
    }
    return 0;
}