#include <fstream>

using namespace std;

const int N = 100000;

int t[N+1], nr[N+1];

int radacina(int x) {
    if (t[x] == 0) {
        return x;
    }
    return radacina(t[x]);
}

int main() {
    ifstream in("disjoint.in");
    ofstream out("disjoint.out");
    int n, q;
    in >> n >> q;
    for (int i = 1; i <= n; i++) {
        nr[i] = 1;
    }
    for (int i = 0; i < q; i++) {
        int tip, x, y;
        in >> tip >> x >> y;
        int rx = radacina(x);
        int ry = radacina(y);
        if (tip == 1) {
            if (nr[rx] <= nr[ry]) {
                t[rx] = ry;
                nr[ry] += nr[rx];
            } else {
                t[ry] = rx;
                nr[rx] += nr[ry];
            }
        } else {
            if (rx == ry) {
                out << "DA\n";
            } else {
                out << "NU\n";
            }
        }
    }
    in.close();
    out.close();
    return 0;
}