#include <fstream>

int paduri[100001], rang[100001];

void unite(int x, int y) {
    if (rang[x] > rang[y]) {
        paduri[y] = x;
    } else {
        paduri[x] = y;
    }

    if (rang[x] == rang[y]) {
        rang[y]++;
    }
}

int find(int x) {
    int root;
    for (root = x; paduri[root] != root; root = paduri[root]);

    while (paduri[x] != x) {
        int y = paduri[x];
        paduri[x] = root;
        x = y;
    }

    return root;
}

int main() {
    std::ifstream fin("disjoint.in");
    std::ofstream fout("disjoint.out");
    int n, m;

    fin >> n >> m;
    for (int i = 1; i <= n; i++) {
        paduri[i] = i;
        rang[i] = 1;
    }
    for (int i = 0; i < m; i++) {
        int cod, x, y;
        fin >> cod >> x >> y;
        if (cod == 1) {
            unite(find(x), find(y));
        } else {
            fout << (find(x) == find(y) ? "DA" : "NU") << '\n';
        }
    }
    return 0;
}