#include <bits/stdc++.h>
#define ll long long
using namespace std;

int pointeaza[100100], rang[100100], n, m;

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

int radacina(int x) {
    int Radacina, y;
    for (Radacina = x; pointeaza[Radacina] != Radacina; Radacina = pointeaza[Radacina]);
    while (pointeaza[x] != x) { // compresie
        y = pointeaza[x];
        pointeaza[x] = Radacina;
        x = y;
    }
    return Radacina;
}

void reuniune(int x, int y) {
    if (rang[x] > rang[y]) {
        pointeaza[y] = x;
    }
    else {
        pointeaza[x] = y;
    }
    if (rang[x] == rang[y]) {
        rang[y]++;
    }
}

int main() {
    fin.tie(0);
    ios::sync_with_stdio(0);
    fin >> n >> m; 
    for (int i = 1; i <= n; ++i) {
        pointeaza[i] = i;
        rang[i] = 1;
    }
    for (int i = 1; i <= m; ++i) {
        int cod, x, y;
        fin >> cod >> x >> y;
        if (cod == 2) {
            if (radacina(x) == radacina(y)) {
                fout << "DA\n";
            }
            else {
                fout << "NU\n";
            }
        }
        else {
            if (radacina(x) != radacina(y)) {
                reuniune(radacina(x), radacina(y));
            }
        }
    }
    return 0;
}