#include <fstream>

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

int n, m;
int T[100005];

void Union(int x, int y) {
    T[x] = y;
}
int FindRoot(int x){
    int y, root = x;
    while (T[root] != 0) {
        root = T[root];
    }
    while (x != root) {
        y = T[x];
        T[x] = root;
        x = y;
    }

    return root;
    
}

int main() {
    int q, x, y;
    fin >> n >> m;
    for (int i = 1; i <= m; i++) {
        fin >> q >> x >> y;
        x = FindRoot(x); y = FindRoot(y);
        if (q == 1) {
            Union(x, y);
        }
        else {
            fout << (x == y ? "DA" : "NU") << "\n";
        }
    }

    fout.close();
}