#include<fstream>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int grad[100001],x,y,aux,aux1,aux2,n,m,i,par[100001];   ;
inline void leg()
{int aux1,aux2;
	aux1 = x;
	while (par[aux1] != aux1)
		aux1 = par[aux1];
	aux2 = y;
	while (par[aux2] != aux2)
		aux2 = par[aux2];
	if (grad[aux1] < grad[aux2])
		par[aux1] = aux2;
	else
	{   par[aux2] = aux1;
	    if (grad[aux1] == grad[aux2])
			++grad[aux1];
	}
}
inline void ver()
{int a;
    aux1 = x;
	while (par[aux1] != aux1)
		aux1 = par[aux1];
	aux2 = y;
	while (par[aux2] != aux2)
		aux2 = par[aux2];
	if (aux1 != aux2)
		fout << "NU \n";
	else
		fout << "DA \n";
	a = x;
	while (par[a] != a)
	{	a = par[a];
	    par[a] = aux1;
	}
    a = y;
	while (par[a] != a)
	{	a = par[a];
	    par[a] = aux2;
	}
}
int main()
{   fin >> n >> m;
    for (i=1;i<=n;++i)
		par[i] = i;
	for (i=1;i<=m;++i)
	{	fin >> aux >> x >> y;
		if (aux == 1)
			leg();
		else
			ver();
	}
	return 0;
}