#include <bits/stdc++.h>
#define ii pair<int, int>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");

class DSU {
private:
    vector<int> root, height;
public:
    DSU(int n) {
        root.resize(n + 1);
        height.resize(n + 1);
        for (int i = 0; i <= n; ++i) {
            root[i] = i, height[i] = 1;
        }
    }
    int findRoot(int x) {
        int node = x;
        while (root[node] != node) {
            node = root[node];
        }
        while (root[x] != x) {
            int aux = root[x];
            root[x] = node;
            x = aux;
        }
        return node;
    }
    void unite(int x, int y) {
        x = root[x], y = root[y];
        if (height[x] > height[y]) {
            root[y] = x;
            height[x] += height[y];
        } else {
            root[x] = y;
            height[y] += height[x];
        }
    }
};

int main() {
    int n, m;
    fin >> n >> m;
    DSU tree(n);
    for (int i = 1; i <= m; ++i) {
        int code, x, y;
        fin >> code >> x >> y;
        if (code == 1) {
            tree.unite(x, y);
        } else {
            if (tree.findRoot(x) == tree.findRoot(y)) {
                fout << "DA\n";
            } else {
                fout << "NU\n";
            }
        }
    }
    return 0;
}