#include <iostream>
#include <fstream>

using namespace std;

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

int father[100001];

int findFather(int node) { // Functie care gaseste tatal unui nod
    if(father[node] != node)
        return father[node] = findFather(father[node]);
    return node;
}

int main() {
    int n, m, operatie, x, y;

    fin >> n >> m;
    for(int i = 0; i < n; i++) // initial tatal unui nod este el insusi
        father[i] = i;

    for(int i = 0; i < m; i++) {
        fin >> operatie >> x >> y;

        if(operatie == 1)
            father[findFather(y)] = findFather(x);
        else {
            if(findFather(x) == findFather(y))
                fout << "DA\n";
            else fout << "NU\n";
        }
    }
    fin.close();
    fout.close();
    return 0;
}