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

int GR[nmax];

int grupa ( int x )
{
	if (GR[x] == x) return x;
	GR[x] = grupa(GR[x]);
	return GR[x];
}

int main ()
{
	int n, t, tip, x, y, i;
	freopen("disjoint.in","r",stdin);
	freopen("disjoint.out","w",stdout);
	scanf("%d %d ", &n, &t);
	for (i = 1; i <= n; ++i) GR[i] = i;
	while ( t-- )
	{
		scanf("%d %d %d ", &tip, &x, &y);
		if ( tip == 1 )
			GR[grupa(x)] = grupa(y);
		else
			if (grupa(x) == grupa(y)) printf("DA\n");
				else printf("NU\n");
	}
	return 0;
}