#include <fstream>
#include <string.h>
#include <vector>
#include <cmath>
#include <queue>
#include <iostream>


using namespace std;

int parentVec[100005];
int distVec[100005];
int maxN, opCount, opType, a, b;

int GetRoot(int a) {
    if (parentVec[a] == 0) {
        return a;
    }
    parentVec[a] = GetRoot(parentVec[a]);
    return parentVec[a];
}

void UnionSet(int a, int b) {
    int rootA = GetRoot(a);
    int rootB = GetRoot(b);

    int distA = distVec[rootA];
    int distB = distVec[rootB];

    if (distA < distB) {
        parentVec[rootA] = rootB;
    }
    else if(distA > distB) {
        parentVec[rootB] = rootA;
    }
    else {
        parentVec[rootB] = rootA;
        distVec[rootA] = distA + 1;
    }
}

int main() {
    ifstream myIn("disjoint.in");
    myIn >> maxN >> opCount;

    ofstream myOut("disjoint.out");
    for (int i = 0; i < opCount; i++) {
        myIn >> opType >> a >> b;

        if (opType == 1) {
            // reuniune
            UnionSet(a, b);
        }
        else {
            // bool
            if (GetRoot(a) == GetRoot(b)) {
                myOut << "DA" << endl;
            }
            else {
                myOut << "NU" << endl;
            }
        }
    }
    myOut.close();
    return 0;
}