#include <bits/stdc++.h>
using namespace std;

const int MAX = 1e5;
int p[MAX + 1], sz[MAX + 1];

int Find(int x) {
    while (x != p[x]) x = p[x];
    return x;
}

void Union(int x, int y) {
    x = Find(x);
    y = Find(y);
    if (sz[x] < sz[y]) {
        p[x] = p[y];
        sz[y] += sz[x];
        sz[x] = 0;
    } else {
        p[y] = x;
        sz[x] += sz[y];
        sz[y] = 0;
    }
}

int main() {
    ifstream cin("disjoint.in");
    ofstream cout("disjoint.out");
    int n, m;
    cin >> n >> m;
    for (int i = 1; i <= n; i++) {
        p[i] = i;
        sz[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;
}