#include <bits/stdc++.h>
#define startt ios_base::sync_with_stdio(false);cin.tie(0);
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
typedef unsigned long long ull;
typedef long long  ll;
using namespace std;
#define FOR(n) for(int i=0;i<n;i++)
#define vt vector
#define vint vector<int>
#define all(v) v.begin(), v.end()
#define MOD 1000000007
#define MOD2 998244353
#define MX 1000000000
#define nax 100005
#define MXL 1000000000000000000
#define PI 3.14159265
#define pb push_back
#define pf push_front
#define sc second
#define fr first
#define int ll
#define endl '\n'
#define ld long double

vector<int> read(int n) {vector<int> a; for (int i = 0; i < n; i++) { int x; cin >> x; a.pb(x);} return a;}

const int NMAX = 2e5+5;

int p[NMAX], sz[NMAX];

void initializedsu(int n)
{
	for(int i = 1; i <= n; i++)
	{
		p[i] = i;
		sz[i] = 1;
	}
}

int find(int x)
{
	int parent;
	if(x == p[x])
	{
		return x;
	}
	parent = find(p[x]);
	p[x] = parent;
	return parent;
}

void unite(int x, int y)
{
	int leaderx = find(x);
	int leadery = find(y);
	if(sz[leaderx] >= sz[leadery])
	{
		sz[leaderx]+=sz[leadery];
		p[leadery] = leaderx;
	}
	else
	{
		sz[leadery]+=sz[leaderx];
		p[leaderx] = leadery;
	}
}

int32_t main(){
	startt;
	freopen("disjoint.in", "r", stdin);
	freopen("disjoint.out", "w", stdout);
	int n, m;
	cin >> n >> m;
	initializedsu(n);
	for(int i = 0; i < m; i++)
	{
		int c;
		cin >> c;
		int x, y;
		cin >> x >> y;
		if(c == 1)
		{
			unite(x, y);
		}
		else
		{
			if(find(x) == find(y))
			{
				cout << "DA" << endl;
			}
			else
			{
				cout << "NU" << endl;
			}
		}
	}
}