#include <bits/stdc++.h>

using namespace std;

int v[100001];

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);
}

void query(int x, int y) {
    if (root(x) == root(y))
        cout << "DA\n";
    else
        cout << "NU\n";
}

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

    int n, m;

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

    int op, x, y;
    for (int i = 0; i < m; i++) {
        scanf("%d %d %d", &op, &x, &y);

        if (op == 1)
            join(x, y);
        else {
            query(x, y);
        }
    }
    return 0;
}