#include <fstream>

using namespace std;

ifstream fin ("disjoint.in");
ofstream fout ("disjoint.out");

int T[100001], n, m;

int rad (int x) {
    while (T[x] > 0) {
        x = T[x];
    }
    return x;
}

int main () {
    fin >> n >> m;
    for (int i = 1; i <= n; i++) {
        T[i] = -1;
    }
    for (; m--; ) {
        int op, x, y;
        fin >> op >> x >> y;
        x = rad (x);
        y = rad (y);
        if (op == 2) {
            fout << (x == y ? "DA\n" : "NU\n");
        }
        else {
            if (x != y) {
                if (T[x] < T[y]) {
                    T[x] += T[y];
                    T[y] = x;
                }
                else {
                    T[y] += T[x];
                    T[x] = y;
                }
            }
        }
    }

    return 0;
}