/***************************************************
 * Alex Palcuie
 * Romania - 2013
 * alex [dot] palcuie [at] gmail [dot] com
 * http://palcu.blogspot.com/
****************************************************/

#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <utility>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <iterator>
#include <cstring>

using namespace std;

// Defines
#define NAME(n) #n
#define pr(x) db((x), (#x))
#define prv(v,n) dbv((v), (#v), (n))
#define prw(v) dbw((v), (#v))
#define X first
#define Y second
#define pb push_back

// Helpers
template <typename T>
inline void db(const T x, const char * name){
	cerr << name << " = " << x << '\n';
}
template <typename T> inline void dbv(const T * v, const char * name, int n){
	fprintf(stderr, "=== %s ===\n", name);
	for(int i=0; i<n; i++)
		cerr << v[i] << " ";
	cerr << '\n';
}
template <typename T> inline void dbs(T x){
	cerr << x << ' ';
}

template<typename T>
void dbw(const std::vector<T>& t, const char * name){
	fprintf(stderr, "=== %s ===\n", name);
	unsigned n = t.size();
	for(typename std::vector<T>::size_type i=0; i<n; ++i)
		std::cerr << t[i] << ' ';
	cerr << '\n';
}

// Structs

// Constants
const int N = 100005;
const int INF = 0x3f3f3f3f;

// Globals
int nMultimi, nOperatii, v[N], lg[N];

// Functions
int find(int x){
    int varf = x;
    while(varf != v[varf])
        varf = v[varf];
    while(x != v[x]){
        int next = v[x];
        v[x] = varf;
        x = next;
    }
    return varf;
}

int uneste(int a, int b){
    int varfA = find(a), varfB = find(b);
    if(lg[varfA] < lg[varfB]){
        v[varfA] = varfB;
        lg[varfB] += lg[varfA];
    }
    else{
        v[varfB] = varfA;
        lg[varfA] += lg[varfB];
    }
}

int main(){
	#ifndef ONLINE_JUDGE
	freopen("disjoint.in","r",stdin);
	freopen("disjoint.out","w",stdout);
	#endif

	scanf("%d%d", &nMultimi, &nOperatii);
	int op, a, b, i;
	for(i=1; i<=nMultimi; i++){
        v[i] = i;
        lg[i] = 1;
	}
	for(i=0; i<nOperatii; i++){
        scanf("%d%d%d", &op, &a, &b);
        if(op==1)
            uneste(a,b);
        else{
            if(find(a) == find(b))
                printf("DA\n");
            else
                printf("NU\n");
        }
	}



	return 0;
}