#include <fstream>
#include <algorithm>
#include <cmath>
#include <cstring>
using namespace std;
ifstream cin("disjoint.in");
ofstream cout("disjoint.out");

int v[100005], n, m, i;

int Query(int x){
	int r=x;
	
	while(r!=v[r]) r=v[r];
	while(x!=r){
		int a=v[x];
		v[x]=r;
		x=a;
	}
	return x;
}
 
int main()
{
	cin>>n>>m;
	for (i=1; i<=n; ++i) v[i]=i;
	
	int o, x, y;    
			      		      
	for(i=1; i<=m; ++i){
		cin>>o>>x>>y;
		if (o==1) v[Query(x)]=Query(y);
		else if (Query(x)==Query(y)) cout<<"DA\n";
								else cout<<"NU\n";				
	}
	
	
    return 0;
}