#include <bits/stdc++.h>

using namespace std;

#define NMAX 100005

ifstream in("disjoint.in");
ofstream out("disjoint.out");

int parent[NMAX];
int height[NMAX];

int find_parent(int x, vector<int> path) {
    while (x != parent[x]) {
        path.push_back(x);
        x = parent[x];
    }
    return x;
}

void unite(int x, int y) {
    vector<int> path_x, path_y;
    int parent_x = find_parent(parent[x], path_x);
    int parent_y = find_parent(parent[y], path_y);

    int height_x = height[parent_x];
    int height_y = height[parent_y];

    if (height_x < height_y) {
        parent[parent_x] = parent_y;
        for (int i = 0; i < (int)path_x.size(); ++i) {
            parent[path_x[i]] = parent_y;
        }
    } else {
        parent[parent_y] = parent_x;
        for (int i = 0; i < (int)path_y.size(); ++i) {
            parent[path_y[i]] = parent_x;
        }
    }
    if (height_x == height_y) {
        ++height[parent_x];
    }
}

int main()
{
    int n, m;
    in >> n >> m;

    for (int i = 0; i < n + 1; ++i) {
        parent[i] = i;
    }

    for (int i = 0; i < m; ++i) {
        int op, x, y;
        in >> op >> x >> y;
        if (op == 1) {
            unite(x, y);
        } else {
            vector<int> path_x, path_y;
            int parent_x = find_parent(x, path_x);
            int parent_y = find_parent(y, path_y);
            if (parent_x == parent_y) {
                out << "DA\n";
            } else {
                out << "NU\n";
            }
        }
    }
}