# include <bits/stdc++.h>
using namespace std;

int P[100100], N, M, x, y, t;
int find(int nod){
	if (P[nod]==nod) return nod;
	int p=find(P[nod]);
	P[nod]=p;
	return p;
}

void unite(int a, int b){
a= find(a);
b= find(b);
P[a]=b;
}

int main(){

	ifstream cin("disjoint.in");
    ofstream cout("disjoint.out");
	cin>>N>>M;
	for (int i=1; i<=N; i++) P[i]=i;
	for (int i=1; i<=M; i++){
		cin>>t>>x>>y;
		if (t==1) unite(x,y);
		else cout<<(find(x)==find(y) ? "DA": "NU")<<"\n";
	}
	return 0;
}