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