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

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

inline long parc(long nod) {
	if (tata[nod]) parc(tata[nod]);
	else {long 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) {
			long A = parc(a);
			long B = parc(b);
			tata[B] = A;
		}
		if (c == 2) {
			if (parc(a) == parc(b)) {
				printf("DA\n");
			} else {
				printf("NU\n");
			}
		}
	}
	return 0;
}