#include <fstream>
#include <algorithm>
using namespace std;
int sef[100001];
ifstream cin("disjoint.in");
ofstream cout("disjoint.out");

int sef_suprem(int nod)
{
	if(sef[nod]==nod)
		return nod;
	return sef[nod]=sef_suprem(sef[nod]);
}

void unioni(int x, int y)
{
	int sefx=sef_suprem(x);
	int sefy=sef_suprem(y);
	sef[sefx]=sefy;
}

int main()
{
    int n,c,x,y,m;
    cin>>n>>m;
    for(int i=1; i<=n; i++)
		sef[i]=i;
	for(int i=1; i<=m; i++)
	{
		cin>>c>>x>>y;
		if(c==1)
			unioni(x,y);
		else if(c==2)
			if(sef_suprem(x)==sef_suprem(y))
			    cout<<"DA"<<endl;
		    else
				cout<<"NU"<<endl;
	}
    return 0;
}