// sursa proasta

#include <bits/stdc++.h>
#define NMAX 100005

using namespace std;

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

int N, M, parent[NMAX];

int _find(int node) {
    if (parent[node] != node) {
        parent[node] = _find(parent[node]);
    }

    return parent[node];
}

void unite(int x, int y) {
    parent[_find(x)] = _find(y);
}

int main() {
    f >> N >> M;
    for (int i = 1; i <= N; ++i) {
        parent[i] = i;
    }

    while (M--) {
        int type, x, y;
        f >> type >> x >> y;
        if (type == 1) {
            unite(x, y);
            continue;
        }

        if (_find(x) != _find(y)) {
            g << "DA\n";
        } else {
            g << "NU\n";
        }
    }
    return 0;
}