#include <iostream>
#include <fstream>

using namespace std;

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

const int NMAX = 100000 + 1;

int n, m;

int tata[NMAX];
int rang[NMAX];

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

int radacina(int nod) {
    if (nod == tata[nod]) return nod;
    tata[nod] = radacina(tata[nod]);
    return tata[nod];
}

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

    return (a == b);
}

void uneste(int a, int b) {
    a = radacina(a);
    b = radacina(b);

    if (rang[a] >= rang[b]) tata[b] = a;
    else tata[a] = b;

    if (rang[a] == rang[b]) rang[b]++;
}

void rezolva() {
    int tip, x, y;

    f >> n >> m;

    init();

    for (int i = 1; i <= m; i++) {
        f >> tip >> x >> y;

        if (tip == 1) uneste(x, y);
        else {
            if (sunt_unite(x, y)) g << "DA\n";
            else g << "NU\n";
        }
    }
}

int main() {
    rezolva();
    return 0;
}