#include <iostream>
#include <fstream>

using namespace std;

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

const int NMAX = 100000 + 1;

int n, q;
int tata[NMAX], rang[NMAX];

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

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

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

inline bool sunt_unite(int a, int b) {
    a = radacina(a);
    b = radacina(b);
    return (a == b);
}

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

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