#include <fstream>

using namespace std;

const int NMAX=100000;

int t[NMAX+5],h[NMAX+5];

ifstream fin("disjoint.in");
ofstream fout("disjoint.out");

int FindRoot(int x)
{
	while(x!=t[x])
		x=t[x];
	return x;
}

void UnionSet(int x,int y)
{
	if(h[x]>h[y])//y se leaga de x
		t[y]=x;
	else
		if(h[y]>h[x])//x se leaga de y
			t[x]=y;
		else
		{
			//le leaga y de x
			t[y]=x;
			h[x]++;
		}

}//x,y roots a doi arbori

int main()
{
	int n,m,i,x,y,tx,ty,cod;
    fin>>n>>m;
    for(i=1;i<=n;i++)
	{
		t[i]=i;
		h[i]=1;
	}
	for(i=1;i<=m;i++)
	{
		fin>>cod>>x>>y;

		if(cod==1)
		{
		tx=FindRoot(x);
		ty=FindRoot(y);
		if(tx!=ty)
			UnionSet(tx,ty);
		}
		if(cod==2)
		{
			if(FindRoot(x)==FindRoot(y))
				fout<<"DA"<<"\n";
			else
				fout<<"NU"<<"\n";
		}

	}
    /*for(i=1;i<=n;i++)
		fout<<t[i]<<" ";
	fout<<"\n";
	for(i=1;i<=n;i++)
		fout<<h[i]<<" ";*/
    return 0;
}