#include<bits/stdc++.h>
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int n, q, parent[100001], rang[100001], tip, a, b;
int find(int node){
    if(parent[node]==node)
        return node;
    return parent[node]=find(parent[node]);
}
void merge(int x, int y){
    if(rang[x]>rang[y])
        parent[y]=x, rang[x]+=rang[y];
    else
        parent[x]=y, rang[y]+=rang[x];
}
int main(){
    f >> n >> q;
    for(int i=1; i<=n; i++)
        parent[i]=i, rang[i]=1;
	while(q--){
        f >> tip >> a >> b;
        if(tip==1)
        	merge(find(a), find(b));
        else{
            if(find(a)==find(b))
                g << "DA\n";
            else
                g << "NU\n";
        }
    }
    return 0;
}