#include <iostream>
#include <cstdio>

using namespace std;

const int NMax = 100005;

int dad[NMax], niv[NMax], N, M;

int Find(int x)
{
    if(dad[x]!=x)
        dad[x]=Find(dad[x]);

    return dad[x];
}

void Join(int x, int y)
{
    if(niv[x] > niv[y])
        dad[y]= x;

    else
        dad[x]=y;

    if(niv[x] == niv[y])
        niv[y]++;

}

void Read()
{
    scanf("%d%d", &N, &M);

    for(int i=1; i<=N; ++i)
        dad[i]=i;

    for(int i=1; i<=M; ++i)
    {
        int t, x, y;
        scanf("%d %d %d", &t, &x, &y);

        if(t==1)
        {
            Join(Find(x), Find(y));
        }

        else if(t==2)
        {
            if(Find(x)==Find(y))
                printf("DA\n");
            else
                printf("NU\n");
        }
    }

}

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

    Read();
    return 0;
}