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

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

//O(log* N)
int Find(int x) {//returneaza radacina arborelui in care se afla x
    int r = x;
    while(r != p[r]) {
        r = p[r];
    }
    int y = x;
    while(y != r) {
        int d = p[y];
        p[y] = r;
        y = d;
    }
    return r;
    // 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;
}

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 == 2) {
            if(Find(x) == Find(y)) {
                cout << "DA\n";
            } else {
                cout << "NU\n";
            }
        } else {
            Union(x, y);
        }

    }
}