#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

struct Padure {
    vector<int> tata;
    vector<int> sz;

    Padure(int n) {
        tata.resize(n + 1);
        sz.resize(n + 1, 1);
    }

    int rad(int a) {
        if (tata[a] == 0) {
            return a;
        }
        // optimizare pentru O(n logn)
//        tata[a] = rad(tata[a]);
//        return tata[a];
        return rad(tata[a]);
    }

    bool query(int a, int b) {
        return (rad(a) == rad(b));
    }

    void join(int a, int b) {
        a = rad(a);
        b = rad(b);

        if (sz[a] < sz[b]) {
            tata[a] = b;
            sz[b] += sz[a];
        } else {
            tata[b] = a;
            sz[a] += sz[b];
        }
    }
};

int main() {
    ifstream cin("disjoint.in");
    ofstream cout("disjoint.out");
    int n, m; cin >> n >> m;
    Padure p(n);

    for (int i = 0; i < m; i++) {
        int op; cin >> op;
        int a, b; cin >> a >> b;
        if (op == 1) {
            p.join(a, b);
        } else {
            if (p.query(a, b)) {
                cout << "DA\n";
            } else {
                cout << "NU\n";
            }
        }
    }

    return 0;
}