#include <algorithm>
#include <stack>
#include <queue>
#include <deque>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <cstring>

using namespace std;

//#include <iostream>
#include <fstream>

//ifstream cin ("input.in");
//ofstream cout ("output.out");

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

static const int NMAX = 1e5+5;

int father[NMAX];

int parent (int node) {
	if ( father[node] == node) {
		return node;
	}

	father[node] = parent(father[node]);
	return father[node];
} 

void reunite (int a, int b) {
	father[parent(a)] = parent(b);
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);

	int n, m;
	cin>>n>>m;

	for ( int i = 1; i <= n; ++i ) {
		father[i] = i;
	}

	for ( int i = 1; i <= m; ++i ) {
		int type, a, b;
		cin>>type>>a>>b;

		switch (type) {
			case 1:
				reunite(a, b);
				break;
			case 2:
				if ( parent(a) == parent(b) ) {
					cout<<"DA"<<'\n';
				}
				else {
					cout<<"NU"<<'\n';
				}
				break;
		}
	}
}