#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn=1e5+5;
 vector<int>parent,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 r1=find(x);
    int r2=find(y);
    if (rang[r1]>rang[r2]) {
        parent[r2]=r1;
        return;
    }
    if (rang[r2]>rang[r1]) {
        parent[r1]=r2;
        return;
    }

    parent[r2]=r1;
    rang[r1]+=1;
}

 int main(){
 	ifstream cin("disjoint.in");
 	ofstream cout("disjoint.out");
 	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int n,m;
	cin >> n >> m;
	parent.resize(n+3);
	rang.resize(n+3);
	for(int i=1;i<=n;i++){
		parent[i]=i,rang[i]=1;
	}
	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;
}