#include <bits/stdc++.h>
using namespace std;


int pathCompressionFind(int node, int *parentArray) {
    if(parentArray[node]==-1)
        return node;

    parentArray[node] = pathCompressionFind(parentArray[node], parentArray);
    return parentArray[node];
}


bool areInTheSameSet(int firstNode, int secondNode, int *parentArray) {
    firstNode = pathCompressionFind(firstNode, parentArray);
    secondNode = pathCompressionFind(secondNode, parentArray);

    if (firstNode == secondNode)
        return true;

    return false;
}


void uniteSets(int firstNode, int secondNode, int *parentArray, int *heights) {
    if (areInTheSameSet(firstNode, secondNode, parentArray))
        return;

    firstNode= pathCompressionFind(firstNode, parentArray);
    secondNode= pathCompressionFind(secondNode, parentArray);

    if (heights[firstNode] < heights[secondNode])
        parentArray[firstNode] = secondNode;
    else {
        parentArray[secondNode] = firstNode;

        if (heights[secondNode] == heights[firstNode])
            heights[firstNode]++;
    }
}



//// Naive Implementation
//bool areInTheSameSet(int firstNode, int secondNode, const int *parentArray) {
//    while (parentArray[firstNode] != -1)
//        firstNode = parentArray[firstNode];
//
//    while (parentArray[secondNode] != -1)
//        secondNode = parentArray[secondNode];
//
//    if (firstNode == secondNode)
//        return true;
//
//    return false;
//}
//
//
//void uniteSets(int firstNode, int secondNode, int *parentArray, int *heights) {
//    if (areInTheSameSet(firstNode, secondNode, parentArray))
//        return;
//
//    while (parentArray[firstNode] != -1)
//        firstNode = parentArray[firstNode];
//
//    while (parentArray[secondNode] != -1)
//        secondNode = parentArray[secondNode];
//
//    if (heights[firstNode] < heights[secondNode])
//        parentArray[firstNode] = secondNode;
//    else {
//        parentArray[secondNode] = firstNode;
//
//        if (heights[secondNode] == heights[firstNode])
//            heights[firstNode]++;
//    }
//}


int main() {
    ifstream input;
    input.open("disjoint.in");

    ofstream output;
    output.open("disjoint.out");

    int numberOfSets, numberOfOperations, operationType, firstNode, secondNode;
    input >> numberOfSets >> numberOfOperations;

    int parentArray[numberOfSets], heights[numberOfSets];
    for (int i = 0; i < numberOfSets; i++)
        parentArray[i] = -1, heights[i] = 1;


    for (int i = 0; i < numberOfOperations; i++) {
        input >> operationType >> firstNode >> secondNode;
        firstNode--, secondNode--;

        if (operationType == 2) {
            if (areInTheSameSet(firstNode, secondNode, parentArray))
                output << "DA\n";
            else
                output << "NU\n";
        } else uniteSets(firstNode, secondNode, parentArray, heights);
    }

    output.close();
    input.close();

    return 0;
}