#include <bits/stdc++.h>

using namespace std;
int num_sets;
int num_queries;
vector<int> dad(100001);
vector<int> set_rank(100001);

int find_root(int node) {
    if(node!=dad[node])
        dad[node]=find_root(dad[node]);
    return dad[node];
}

void unite(int first_node,int second_node) {
    int first_root=find_root(first_node);
    int second_root=find_root(second_node);

    if(first_root==second_root)
        return;

    if(set_rank[first_root]<set_rank[second_root])
        swap(first_root,second_root);

    dad[second_root]=first_root;
    if(set_rank[first_root]==set_rank[second_root])
        set_rank[first_root]++;
}

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

    fin>>num_sets>>num_queries;

    for(int i=1; i<=num_sets; i++)
        dad[i]=i,set_rank[i]=1;

    for(int i=1; i<=num_queries; i++) {
        int type,first_node,second_node;
        fin>>type>>first_node>>second_node;
        if(type==1)
            unite(first_node,second_node);
        else if(find_root(first_node)==find_root(second_node))
            fout<<"DA\n";
        else
            fout<<"NU\n";
    }

    return 0;
}