#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <fstream>
using namespace std;

const string file = "disjoint";

const string infile = file + ".in";
const string outfile = file + ".out";

const int INF = 0x3f3f3f3f;


vector<int> tata;
vector<int> grad;
int Find(int x)
{

	stack<int> s;
	int t = tata[x];
	while(t != 0)
	{
		s.push(x);
		x = t;
		t = tata[x];
	}

	while(s.empty() == false)
	{
		int a = s.top();
		s.pop();
		tata[a] = x;
	}

	return x;
}

void Union(int x, int y)
{
	if(grad[x] > grad[y])
		swap(x, y);

	grad[y] += grad[x];
	tata[x] = y;

}




int N, M;
int main()
{

	fstream fout(outfile.c_str(), ios::out);
	fstream fin(infile.c_str(), ios::in);

	fin >> N >> M;

	tata.resize(N + 1);
	grad.resize(N + 1);
	for(int i = 0; i < M; i++)
	{
		int op, x, y;
		fin >> op >> x >> y;
		if(op == 1)
		{
			int a = Find(x);
			int b = Find(y);
			if( a != b)
				Union(a, b);
		}
		else if(op == 2)
		{
			if(Find(x) == Find(y))
				fout << "DA\n";
			else 
				fout << "NU\n";
		}
	}


	fin.close();
	fout.close();
}