#include <iostream>
#include <cstdio>
#include <algorithm>

using namespace std;

int n,m;
int tata[100005],adancime[100005];

void initializare()
{
    for(int i = 1 ; i <= n ; ++i)
    {
        tata[i] = i;
    }
}

int radacina(int x)
{
    int x1 = x;

    while(tata[x] != x)
    {
        x = tata[x];
    }

    int tmp;

    while(tata[x1] != x1)
    {
        tmp = x1;
        x1 = tata[x1];
        tata[tmp] = x;
    }
    return x;
}

void join(int x, int y)
{
    if(adancime[x] == adancime[y])
    {
       tata[radacina(y)] = radacina(x);
       adancime[x]++;
       return;
    }

    if(adancime[x] < adancime[y])
    {
        tata[radacina(x)] = radacina(y);
    }
    else
    {
        tata[radacina(y)] = radacina(x);
    }
}

void citire()
{
    scanf("%d %d\n",&n,&m);

    initializare();

    int tmp,x,y;

    for(int i = 0 ; i < m ; ++i)
    {
        scanf("%d %d %d\n",&tmp,&x,&y);

        if(tmp == 1)
        {
            join(x,y);
        }
        else
        {
            if(radacina(x) == radacina(y))
            {
                printf("DA\n");
            }
            else
            {
                printf("NU\n");
            }
        }
    }
}

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

    citire();

    return 0;
}