#include <bits/stdc++.h>
//#pragma GCC optimize ("03")
#define FastIO ios_base::sync_with_stdio(false) , cin.tie(0) , cout.tie(0)
#define FILES freopen("disjoint.in" , "r" , stdin) , freopen("disjoint.out" , "w" , stdout)
#define ll long long
#define ull unsigned long long
#define ld long double
#define eb emplace_back
#define pb push_back
#define qwerty1 first
#define qwerty2 second
#define qwerty3 -> first
#define qwerty4 -> second
#define umap unordered_map
#define uset unordered_set
#define pii pair < int , int >
#define pq priority_queue
#define dbg(x) cerr << #x << ": " << x << '\n'

namespace FastRead
{
    char __buff[5000];int __lg = 0 , __p = 0;
    char nc()
    {
        if(__lg == __p){__lg = fread(__buff , 1 , 5000 , stdin);__p = 0;if(!__lg) return EOF;}
        return __buff[__p++];
    }
    template<class T>void read(T&__x)
    {
        T __sgn = 1; char __c;while(!isdigit(__c = nc()))if(__c == '-')__sgn = -1;
        __x = __c - '0';while(isdigit(__c = nc()))__x = __x * 10 + __c - '0';__x *= __sgn;
    }
}

using namespace FastRead;
using namespace std;

const int N = 1e5 + 10;
const int M = 1e9 + 7;
const ld PI = acos(-1);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int n , m , type , x , y;
int root[N] , h[N];

int find(int x)
{
    if(x == root[x]) return x;
    else return root[x] = find(root[x]);
}

void unite(int x , int y)
{
    x = find(x); y = find(y);

    if(x == y) return;

    if(h[x] < h[y])
        root[x] = y;
    else if(h[x] > h[y])
        root[y] = x;
    else root[x] = y , ++h[y];
}

signed main()
{
	#ifndef ONLINE_JUDGE
		FastIO , FILES;
	#endif

    cin >> n >> m;

    for(int i = 1 ; i <= n ; i++)
        root[i] = i , h[i] = 1;

    while(m--)
    {
        cin >> type >> x >> y;

        if(type == 1) unite(x , y);
        else cout << (find(x) != find(y) ? "NU" : "DA") << "\n";
    }

    return 0;
}