#include <bits/stdc++.h>

using namespace std;

#define     mp              make_pair
#define     fs              first
#define     sc              second
#define     pob             pop_back
#define     pub             push_back
#define     eps             1E-7
#define     sz(a)           a.size()
#define     count_one       __builtin_popcount;
#define     count_onell     __builtin_popcountll;
#define     fastIO          ios_base::sync_with_stdio(false)
#define     PI              (acos(-1.0))
#define     linf            (1LL<<62)//>4e18
#define     inf             (0x7f7f7f7f)//>2e9

#define MAXN 100010

int n, m;
pair<int, int> el[MAXN];

int findP(int x) {
    if(el[x].fs != x)
        el[x].fs = findP(el[x].fs);
    return el[x].fs;
}

void unite(int x, int y) {
    if(x == y) return;
    if(el[x].sc < el[y].sc)
        el[y].sc += el[x].sc,
        el[x].fs = findP(el[y].fs);
    else
        el[x].sc += el[y].sc,
        el[y].fs = findP(el[x].fs);
}

void read() {
    #ifndef ONLINE_JUDGE
    assert(freopen("disjoint.in", "r", stdin));
    assert(freopen("disjoint.out", "w", stdout));
    #endif

    int cod, x, y;
	assert(scanf("%d%d", &n, &m));
	for(int i = 1; i <= n; ++i) el[i].fs = i, el[i].sc = 1;
	while(m--) {
        assert(scanf("%d%d%d", &cod, &x, &y));
        if(cod == 1)
            unite(x, y);
	    else
            assert(printf("%s\n", (findP(x) == findP(y)) ? "DA" : "NU"));
	}
}

int main() {
	read();

    return 0;
}