#include <iostream>
#include <fstream>

using namespace std;

const int NMAX = 100004;

int rad[NMAX], h[NMAX], n, m;

int find(int x) {
    if (rad[x] != x) {
        rad[x] = find(rad[x]);
    }

    return rad[x];
}

void _union(int x, int y) {
    int radx = find(x);
    int rady = find(y);

    if (radx == rady) {
        return;
    }

    if (h[radx] > h[rady]) {
        rad[rady] = rad[radx];
    } else if (h[radx] < h[rady]) {
        rad[radx] = rad[rady];
    } else {
        rad[radx] = rad[rady];
        h[radx] += 1;
    }

} 

int main() {
    ifstream cin("disjoint.in");
    ofstream cout("disjoint.out");

    cin >> n >> m;

    for (int i = 1; i <= n; i++) {
        rad[i] = i;
        h[i] = 1;
    }

    for (int i = 1; i <= m; i++) {
        int op, x, y;

        cin >> op >> x >> y;

        if (op == 1) {
            _union(x, y);
        } else if (find(x) == find(y)) {
            cout << "DA\n";
        } else {
            cout << "NU\n";
        }
    }

    return 0;
}