#include <iostream>
#include <fstream>

using namespace std;

#define MAX 100010

int aceeasi(int pad[], int x, int y) {
    int radx = x, rady = y, aux;

    while (pad[radx] != 0) {
        radx = pad[radx];
    }

    while (pad[rady] != 0) {
        rady = pad[rady];
    }

    while (pad[x] != 0) {
        aux = pad[x];
        pad[x] = radx;
        x = aux;
    }

    while (pad[y] != 0) {
        aux = pad[y];
        pad[y] = rady;
        y = aux;
    }

    return radx == rady;
}

void reuniune(int pad[], int inaltime[], int x, int y) {
    while (pad[x] != 0) {
        x = pad[x];
    }

    while (pad[y] != 0) {
        y = pad[y];
    }

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

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

    int n, m, pad[MAX], x, y, op, inaltime[MAX];

    fin >> n >> m;

    for (int i = 1; i <= n; i++) {
        pad[i] = 0;
        inaltime[i] = 1;
    }

    for (int i = 0; i < m; i++) {
        fin >> op >> x >> y;

        if (op == 1) {
            reuniune(pad, inaltime, x, y);
        } else {
            if (aceeasi(pad, x, y)) {
                fout << "DA\n";
            } else {
                fout << "NU\n";
            }
        }
    }

    fin.close();
    fout.close();

    return 0;
}