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