#include <iostream>
#include <fstream>
#include <cmath>
#include <vector>
#include <bitset>
#include <queue>
#include <deque>
#include <list>
#include <set>
#include <ctime>
#include <string>
#include <cstring>
#include <algorithm>
using namespace std;
ifstream ff("disjoint.in");
ofstream gg("disjoint.out");
#define max 100001
int n, m, rr[max];

int rad(int a){
	if(rr[a]==a) return a; else {
		rr[a]=rad(rr[a]);
		return rr[a];
	}
}

int main(){
	int o, a, b;
	ff >> n >> m;
	for(int i=1;i<=n;i++) rr[i] = i;
	for(int i=0;i<m;i++){
		ff >> o >> a >> b;
		if(o==1) rr[rad(a)]=rad(b); else
		if(rad(a)==rad(b)) gg << "DA\n"; else gg << "NU\n";
	}
	return 0;
}