#include<cstdio>
#include<vector>
using namespace std;

vector <int> tata, rang;

int Find(int x){
	if (tata[x] == x) return x;
		else{
			tata[x] = Find(tata[x]);
			return tata[x];
		}
}

void Merge (int &x, int &y){
	int xRoot = Find(x), yRoot = Find(y);
	if (xRoot == yRoot) return;
	
	(rang[xRoot] >= rang[yRoot]) ? tata[yRoot] = xRoot : tata[xRoot] = yRoot;
	if (rang[xRoot] = rang[yRoot]) rang[xRoot]++;
}

int main(){
	int n, m, i, tip, x, y;
	freopen("disjoint.in", "r", stdin);
	freopen("disjoint.out", "w", stdout);
 
	scanf("%d %d ", &n, &m);
	
	for (i = 0; i <= n; i++) tata.push_back(i);
	rang.assign(n+1, 1);
	
	for (i = 1; i <= m; i++){
		scanf("%d %d %d", &tip, &x, &y);
		if (tip == 1) Merge(x, y);
			else Find(y) == Find(x) ? printf("DA\n") : printf("NU\n");
	}
	
	return 0;
}