#include <iostream>
#include <fstream>
#include <queue>
#include <vector>

using namespace std;

const int nmax=100000;
queue <int> coada;
vector <int> muchi[nmax];
int n,m;
bool viz[nmax];

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

void dfs(int nod){
 viz[nod]=1;
 for(unsigned int i=0;i<muchi[nod].size();i++){
 	int vecin =muchi[nod][i];
 	if(!viz[vecin]){
 		dfs(vecin);
	 }
 }
}

int main(){
in >>n>>m;

for(int i=1;i<=m;i++){
	int tip,x,y;
	in >>tip>>x>>y;
	if(tip==1){
		muchi[x].push_back(y);
		muchi[y].push_back(x);
	}
	if(tip==2){
		dfs(x);
		if(viz[y]){
			out <<"DA";
		}else out <<"NU";
	}
	
	}

return 0;
}