#include <bits/stdc++.h>

using namespace std;

vector<int> v;

int root(int x) {
    if (v[x] == x) return x;
    return v[x] = root(v[x]);
}

void join(int x, int y) {
    v[root(x)] = root(y);
}

bool query(int x, int y) {
    return root(x) == root(y);
}

int main()
{
    freopen("disjoint.in", "r", stdin);
    freopen("disjoint.out", "w", stdout);

    int n, m;

    cin >> n >> m;
    v.reserve(n + 1);
    for (int i = 0; i <= n; i++) {
        v[i] = i;
    }

    int op, x, y;
    for (int i = 0; i < m; i++) {
        cin >> op >> x >> y;

        switch (op) {
        case 1:
            join(x, y);
            break;

        case 2:
            if (query(x, y)) {
                cout << "DA\n";
            } else {
                cout << "NU\n";
            }
            break;
        }
    }
    return 0;
}