#include <bits/stdc++.h>
#define ll long long
#define cin fin
#define cout fout
using namespace std;
const int maxn=1e5+1;
ifstream cin("disjoint.in");
ofstream cout("disjoint.out");
vector<int>parent(maxn),rang(maxn);
 int find(int node){
 	if(parent[node]==node){
 		return node;
	}
	else return find(parent[node]);
 }
 void merge(int x,int y){
 	int xset= find(x);
 	int yset= find(y);
 	if(xset==yset) return;
 	if(rang[xset]>rang[yset]) parent[yset]=xset;
 	else{
 		parent[xset]=yset;
		if(rang[xset]==rang[yset]) rang[yset]++;	
	}
 }
 int main(){
	int n,m;
	cin >> n >> m;
	for(int i=1;i<=n;i++){
		parent[i]=i;
	}
	for(int i=1;i<=m;i++){
		int cod,x,y;
		cin >> cod >> x >> y;
		if(cod==1) merge(x,y);
		else{
			if(find(x)==find(y)) cout << "DA" << endl;
			else cout << "NU" << endl;	
		}
	}
 	return 0;
}