#include <iostream>
#include <fstream>
using namespace std;

int parent[100000];

int main() {
    ifstream input("disjoint.in");
    ofstream output("disjoint.out");
    int N, M;
    input >> N >> M;
    for (int q = 1; q <= N; q++) {
        parent[q] = q;
    }
    for (int q = 0; q < M; q++) {
        int type;
        int x, y;
        input >> type >> x >> y;
        if (type == 1) {
            int parentX = parent[x];
            int parentY = parent[y];
            parent[parentY] = parentX;
        } else {
            bool freq[100000] = {false};
            freq[parent[x]] = true;
            while (x != parent[x]) {
                freq[x] = true;
                x = parent[x];
            }
            bool found = false;
            while (y != parent[y]) {
                if (freq[parent[y]]) {
                    found = true;
                    break;
                }
                y = parent[y];
            }

            cout << (found ? "DA" : "NU") << '\n';
        }
    }
    return 0;
}