#include <iostream>
#include <fstream>
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int tt[100001], rang[100001];
int find(int x)
{
	int root, y;
	for (root = x; tt[root] != root; root = tt[root]);
	for (; tt[x] != x;)
	{
		y = tt[x];
		tt[x] = root;
		x = y;
	}
	return root;
}

void unite(int a, int b)
{
	if (rang[a] > rang[b])
	{
		tt[b] = tt[a];
		rang[a] += rang[b];
	}
	else
	{
		tt[a] = tt[b];
		rang[b] += rang[a];
	}
}

int main()
{
	int n, m, i;
	f >> n;
	f >> m;
	for (i = 1; i <= n; i++)
	{
		tt[i] = i;
		rang[i] = 1;
	}
	while (m--)
	{
		int b, x, y;
		cin >> b >> x >> y;
		if (b == 1)
		{
			unite(x, y);
		}
		else {
			if (find(x) == find(y)) g << "DA" << endl;
			else g << "NU" << endl;
		}
	}
}