#include <fstream>
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int v[1000000],n,m;

int main(void){
	register int i,j,t,x,y;
		
	f>>n>>m;
	for(i=1;i<=n;i++)
		v[i]=-1;
	int x1,y1;
	for(i=1;i<=m;i++){
		f>>t>>x>>y;
		if(t==1){
			//unim radacinile arborilor
			x1=x,y1=y;
			while(v[x1]>0){
				x1=v[x1];
			}
			while(v[y]>0){
				y1=v[y1];
			}
			if(x1<y1){
				v[y1]=x1;
			}
			else{
				v[x1]=y1;
			}
		}
		if(t==2){
			x1=x,y1=y;
			while(v[x1]>0){
				x1=v[x1];
			}
			while(v[y1]>0){
				y1=v[y1];
			}
			if(y1==x1)
				g<<"DA"<<"\n";
			else
				g<<"NU"<<"\n";
		}
	}
	return 0;
}