#include <iostream>
#include <fstream>

using namespace std;

ifstream f ("disjoint.in");
ofstream g ("disjoint.out");

const int NMAX = 100000 + 1;

int n, m;
int inaltime[NMAX], tata[NMAX];

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

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

bool query(int a, int b) {
    int radacina_a = radacina(a), radacina_b = radacina(b);
    return radacina_a == radacina_b;
}

void uneste(int a, int b) {
    a = radacina(a);
    b = radacina(b);
    if (inaltime[b] > inaltime[a]) tata[a] = b;
    else tata[b] = a;
    if (inaltime[b] == inaltime[a]) inaltime[a]++;
}

void rezolva() {
    int tip, a, b;
    while(m--) {
        f >> tip >> a >> b;
        if (tip == 1) uneste(a, b);
        else {
            if (query(a, b)) g << "DA";
            else g << "NU";
            g << '\n';
        }
    }
}

int main() {
    f >> n >> m;
    initializeaza();
    rezolva();
    return 0;
}