#include<fstream>
#define NMAX 100005
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int n,m,TT[NMAX];
inline int find(int x)
{
	int i;
	for(i=x;TT[i]!=i;i=TT[i]);
	return i;
}
int main()
{
	fin>>n>>m;
	for(int i=1;i<=n;i++)
		TT[i]=i;
	int choice,x,y;
	while(m--)
	{
		fin>>choice>>x>>y;
		if(choice==1)
		{
			TT[find(y)]=find(x);
			continue;
		}
		if(find(x)==find(y))
			fout<<"DA\n";
		else
			fout<<"NU\n";
	}
	fin.close();
	fout.close();
	return 0;
}