#include <iostream>
#include <cstdio>

using namespace std;

const int NMax = 100005;
int GR[NMax];
int niv[NMax];
int N, M;

int Find(int nod)
{
    if(nod != GR[nod])
        GR[nod] = Find(GR[nod]);

    return GR[nod];
}

void Join(int x, int y)
{
    if(niv[x] == niv[y])
    {
        ++niv[x];
        GR[y] = x;
    }

    else
        if(niv[x] > niv[y])
    {
        GR[y] = x;
    }

    else
        GR[x] = y;
}

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

    scanf("%d%d", &N,&M);

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

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

        else
            if(Find(x) == Find(y))
                cout << "DA\n";
            else
                cout << "NU\n";
    }
    return 0;
}