#include <cstdio>

#define MAX_N 100020

int T[MAX_N], R[MAX_N];
int N, M;

int find(int x)
{
	int R, y;

	for (R = x; T[R] != R; R = T[R]);

	for (; T[x] != x;)
	{
		y = T[x];
		T[x] = R;
		x = y;
	}
	return R;
}

void unite(int x, int y)
{
	if (R[x] > R[y])
	T[y] = x;
	else T[x] = y;

	if (R[x] == R[y]) R[y]++;
}

int main()
{
	freopen("disjoint.in", "r", stdin);
	freopen("disjoint.out", "w", stdout);
	
	scanf("%d %d ", &N, &M);

	int i, x, y, cd;

	for (i = 1; i <= N; i++)
	{
		T[i] = i;
		R[i] = 1;
	}

	for (i = 1; i <= M; i++)
	{
		scanf("%d %d %d", &cd, &x, &y);
		
		if (cd == 2){
			if (find(x) == find(y)) printf("DA\n");
				else printf("NU\n");
		}
			else 
				
					unite(find(x), find(y));
				
	}

}