#include <bits/stdc++.h>

using namespace std;

ifstream fin("disjoint.in");
ofstream fout("disjoint.out");

const int NMAX = 100002;
int tati[NMAX], inaltime[NMAX];
int n, m, op;

int radacina(int nod)
{
    int rad = nod;
    while(rad != tati[rad])
    {
        rad = tati[rad];
    }

    while(nod != rad)
    {
        int aux = tati[nod];
        tati[nod] = rad;
        nod = aux;
    }
    return rad;
}

void unite(int x, int y)
{
    x = radacina(x);
    y = radacina(y);

    if(inaltime[x] > inaltime[y])
        tati[y] = x;
    else if(inaltime[x] < inaltime[y])
        tati[x]= y;
    else{
        tati[x] = y;
        inaltime[y]++;
    }
}

int main()
{
    fin >> n >> m;
    for(int i=1; i<=n; ++i)
    {
        tati[i] = i;
        inaltime[i] = 1;
    }

    for(int i=1; i<=m; ++i)
    {
        int x, y;
        fin >> op >> x >> y;
        if(op == 1)
        {
            unite(x, y);
        }else{
            if(radacina(x) == radacina(y))
                fout << "DA" << "\n";
            else fout << "NU" << "\n";
        }
    }

    return 0;
}