#include <stdio.h>

#define NMAX 100020

int TT[NMAX], RG[NMAX];
int N, M;

int find(int x)
{
	int R, y;
	
	for(R = x; TT[R] != R; R = TT[R]);
	
	for(; tt[x], != x)
	{
		y = TT[x];
		TT[x] = R;
		x = y;
	}
	
	return R;
}

void unite(int x, int y)
{
	if(RG[x] > RG[y])
		TT[y] = x;
	else
		TT[x] = y;
		
	if(RG[x] == RG[y])
		RG[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++)
	{
		TT[i] = i;
		RG[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
		{
			if(find(x) == find(y)
			{
				fprintf(stderr, "%d ", i);
				return 0;
			}
			unite(find(x), find(y);	// poate fi optimizat
		}
	}

	return 0;
}