#include <bits/stdc++.h>

using namespace std;

ifstream f("disjoint.in");
ofstream g("disjoint.out");

vector<int> T, Rang;
int n, m, op, x, y;

int Radacina(int k)
{
	if (T[k] == 0)
		return k;
	else
	{
		int x = Radacina(T[k]);
		T[k] = x;
		return x;
	}
}

void DSU(int i, int j)
{
	int ri = Radacina(i), rj = Radacina(j);
	if (ri != rj)
	{
		if (Rang[ri] > Rang[rj])
			T[rj] = ri;
		else
		{
			T[ri] = rj;
			if (Rang[ri] == Rang[rj])
				Rang[rj]++;
		}
	}
}

int main()
{
	f >> n >> m;
	T = Rang = vector<int> (n+1, 0);
	while (m--)
	{
		f >> op >> x >> y;
		if (op == 1)
			DSU(x, y);
		else
		if (op == 2)
		{
			int rx = Radacina(x), ry = Radacina(y);
			g << (rx == ry ? "DA\n" : "NU\n");
		}
	}
	f.close();
	g.close();
    return 0;
}