#include <bits/stdc++.h>

using namespace std;

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

//returneaza radacina arborelui din care face parte
//In urma acestui proces, orice arbore de inaltime h are cel putin 2^h noduri
int Find(int x) {
    // while(x != p[x]) {
    //     x = p[x];
    // }
    if(x == p[x]) {
        return x;
    }
    return p[x] = Find(p[x]);
}

void Union(int x, int y) {
    x = Find(x);
    y = Find(y);

    if(sz[x] < sz[y]) {
        swap(x, y);
    }
    p[y] = x;
    sz[x] += sz[y];
    sz[y] = 0; // nu e obligatoriu
}



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