#include <iostream>
#include <fstream>
#define maxN 100005

using namespace std;

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

int n, m, rang[maxN], tata[maxN];

void make_set () {
    for (int i = 1; i <= n; ++i) {
        tata[i] = i;
        rang[i] = 0;
    }
}

int find (int nod) {
    if (tata[nod] != nod) {
        tata[nod] = find(tata[nod]);
    }
    return tata[nod];
}

void Union (int a, int b) {
    if (rang[a] > rang[b]) {
        tata[b] = a;
    }
    else {
        if (rang[a] < rang[b])
            tata[a] = b;
        else {
            tata[a] = b;
            rang[b]++;
        }
    }
}

int main () {
    fin >> n >> m;
    make_set();

    int Q;
    for (int i = 1; i <= m; ++i) {
        fin >> Q;
        if (Q == 1) {
            int a, b;
            fin >> a >> b;
            Union(find(a), find(b));
        }
        if (Q == 2) {
            int a, b;
            fin >> a >> b;
            if (find(a) == find(b))
                fout << "DA" << '\n';
            else
                fout << "NU" << '\n';
        }
    }
}