#include <fstream>

using namespace std;

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

const int NMAX = 100000;

int n, m;
int parent[NMAX + 1], sz[NMAX + 1];
int op, x, y;

int find_set(int v) {
    if (v == parent[v])
        return v;
    return parent[v] = find_set(parent[v]);
}

void make_set(int v) {
    parent[v] = v;
    sz[v] = 1;
}

void union_sets(int a, int b) {
    a = find_set(a);
    b = find_set(b);
    if (a != b) {
        if (sz[a] < sz[b])
            swap(a, b);
        parent[b] = a;
        sz[a] += sz[b];
    }
}

int main()
{
    fin >> n >> m;
    for (int i = 1; i <= n; i++)
        make_set(i);
    for (int i = 1; i <= m; i++) {
        fin >> op >> x >> y;
        if (op == 1)
            union_sets(x, y);
        else {
            if (find_set(x) == find_set(y))
                fout << "DA";
            else
                fout << "NU";
            fout << '\n';
        }
    }
    return 0;
}