#include<bits/stdc++.h>
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int parent[100001], rang[100001];
int find1(int node){
    if(parent[node]==node)
        return node;
    return parent[node]=find1(parent[node]);
}
void union1(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(){
	int n,q,cod,a,b;
    f >> n >> q;
    for(int i=1; i<=n; i++){
    	parent[i]=i;
		rang[i]=1;	
	}
	while(q--){
        f >> cod >> a >> b;
        if(tip==1) union1(find1(a), find1(b));
        else{
            if(find1(a)==find1(b)) g << "DA" << endl;
            else g << "NU" << endl;
        }
    }
    return 0;
}