#include <stdio.h>
#include <vector>
#define MAX 100005
using namespace std;

int set[MAX], size[MAX];
vector<int> l[MAX];
int i;

void MakeSet(int n);
void Merge(int x, int y);
void Union(int x, int y);

int main(){
	freopen("disjoint.in", "r", stdin);
	freopen("disjoint.out", "w", stdout);
	int n, m, x, y, type;
	scanf("%d%d", &n, &m);
	MakeSet(n);

	for(i = 0; i < m; i++){
		scanf("%d%d%d", &type, &x, &y);
		if(type == 1)
			Union(x, y);
		else
			printf(set[x] == set[y] ? "DA\n" : "NU\n");
	}
	return 0;
}

void MakeSet(int n){
	for(i = 1; i <= n; i++){
		set[i] = i;
		l[i].push_back(i);
	}
}

void Merge(int x, int y){
	while(!l[x].empty()){
		int n = l[x].back();
		l[x].pop_back();
		set[n] = y;
		l[y].push_back(n);
	}
	size[y] += size[x];
	size[x] = 0;
}

void Union(int x, int y){
	int fx = set[x], fy = set[y];
	if(size[fx] < size[fy])
		Merge(fx, fy);
	else
		Merge(fy, fx);
}