#include <fstream>
#include <iostream>
#include <string>
#include <complex>
#include <cmath>
#include <set>
#include <vector>
#include <map>
#include <queue>
#include <cstdio>
#include <stack>
#include <algorithm>
#include <list>
#include <bitset>
#include <ctime>
#include <cassert>
#include <iomanip>

using namespace std;


const string file = "disjoint";
const string inputF = file + ".in";
const string outputF = file + ".out";

const double epsilon = 1e-7;
#define LL long long
#define ULL unsigned long long 
#define MOD1 666013
#define MOD2 666019
#define MOD3 1999999973
#define base 73

typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<bool> vb;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<double> vd;
typedef vector<string> vs;
typedef pair<int, int> ii;
typedef pair<long long, long long> ll;
typedef vector<ii> vii;
typedef vector<ll> vll;

#define all(V) V.begin(), V.end()
#define allr(V) V.rbegin(), V.rend()
#define for_c_it(container, it) for (auto it : container)
#define present(container, element) (container.find(element) != container.end()) 
#define sz(a) int((a).size()) 
#define pb push_back 
#define mp make_pair
#define zeroes(x) ((x ^ (x - 1)) & x)

int N, Q;
vi father, hg;

void update(int x, int y);
string query(int x, int y);

int main() {
#ifndef INFOARENA
	freopen("input.txt", "r", stdin);
#else 
	freopen(inputF.c_str(), "r", stdin);
	freopen(outputF.c_str(), "w", stdout);
#endif
	int i, x, y, cod;
	
	scanf("%d %d", &N, &Q);
	father.resize(N + 1);
	hg.resize(N + 1, 1);
	
	for (i = 0; i < Q; ++i) {
		scanf("%d %d %d", &cod, &x, &y);
		if (cod == 1) {
			update(x, y);
		}
		else {
			printf("%s\n", query(x,y).c_str());
		}
	}		

	return 0;
}

void update(int x, int y) {
	int rx, ry, R, aux;
	for (rx = x; father[rx] != 0; rx = father[rx]);
	for (ry = y; father[ry] != 0; ry = father[ry]);
	
	if (hg[rx] > hg[ry]) {
		father[ry] = rx;
		R = rx;
		for (; father[y] > 0; y = father[aux]) {
			aux = father[y];
			father[y] = R;
		}
	}
	else {
		father[rx] = ry;
		R = ry;
		if (hg[rx] == hg[ry]) {
			++hg[ry];
		}
		for (; father[x] > 0; x = father[aux]) {
			aux = father[x];
			father[x] = R;
		}
	}
}

string query(int x, int y) {
	for (; father[x] != 0; x = father[x]);
	for (; father[y] != 0; y = father[y]);
	if (x == y) {
		return "DA";
	}
	return "NU";
}