#include <bits/stdc++.h>

using namespace std;

const int len = 100005;
int n, m, key, x, y, parent[len], level[len];

int make_set(int k) {
    parent[k] = k;
    level[k] = 0;
}

int find_set(int k) {
    if (parent[k] == k)
        return k;
    return parent[k] = find_set(parent[k]);
}

void union_sets(int x, int y) {
    int a = find_set(x);
    int b = find_set(y);
    if (a != b) {
        if (level[a] < level[b])
            swap(a, b);
        parent[b] = a;
        if (level[a] == level[b])
            level[a]++;
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

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

    cin >> n >> m;
    for (int i = 0; i < n; i++)
        make_set(i);
    for (int i = 0; i < m; i++) {
        cin >> key >> x >> y;
        if (key == 2)
            if (find_set(x) == find_set(y))
                cout << "DA\n";
            else
                cout << "NU\n";
        else
            union_sets(x, y);
    }
}