#include <fstream>
#include <vector>

using namespace std;

int N, M;
vector <vector <int>> graph;

class DSU {
private:
    vector <int> parent;
    vector <int> sz;
public:
    DSU(int N) {
        parent = vector <int>(N, -1);
        sz = vector <int>(N, 1);
    }
    int find(int node) {
        if (parent[node] == -1) {
            return node;
        }
        return parent[node] = find(parent[node]);
    }
    void unite(int x, int y) {
        if (sz[x] < sz[y]) {
            swap(x, y);
        }
        parent[y] = x;
        sz[x] += sz[y];
    }
};

int main() {
    ifstream fin("disjoint.in");
    ofstream fout("disjoint.out");
    fin >> N >> M;
    DSU disjoint(N);
    for (int i = 0; i < M; ++i) {
        int type, u, v;
        fin >> type >> u >> v;
        --u; --v;
        if (type == 1) {
            u = disjoint.find(u);
            v = disjoint.find(v);
            if (u != v) {
                disjoint.unite(u, v);
            }
        }
        else {
            fout << (disjoint.find(u) == disjoint.find(v) ? "DA" : "NU") << "\n";
        }
    }
    fin.close();
    fout.close();
    return 0;
}