#include <stdio.h>
#include <math.h>

long n, m, i, a, b, c, tata[100010], aux;

inline long parc(long nod, long o) {
	if (aux != -1)
		if (o == 1) tata[nod] = aux;	
	if (tata[nod]) parc(tata[nod], o);
	else {
		if (aux == -1) aux = nod; 
		return aux;
	}
}

int main() {
	freopen("disjoint.in", "r", stdin);
	freopen("disjoint.out", "w", stdout);
	
	scanf("%ld %ld", &n, &m);
	for (i = 1; i <= m; ++i) {
		scanf("%ld", &c);
		scanf("%ld %ld", &a, &b);
		if (c == 1) {
			aux = -1;
			long A = parc(a, 0);
			aux = -1;
			long B = parc(b, 0);
			tata[A] = B;
		}
		if (c == 2) {
			aux = -1;
			long u = parc(a, 0);
			aux = -1;
			long y = parc(b, 0);
			if (u == y) {
				printf("DA\n");
			} else {
				printf("NU\n");
			}
			aux = -1;
			if (tata[a]) parc(a, 1);
			aux = -1;
			if (tata[b]) parc(b, 1);			
		}
	}
	return 0;
}