#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("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 , x , y , type;
int roots[N] , heights[N];

int find(int x)
{
    int R = x;

    for( ; R != roots[R] ; R = roots[R]);

    for( ; roots[x] != x ; )
    {
        int next = roots[x];
        roots[x] = R;
        x = next;
    }
}

void unite(int x , int y)
{
    if(heights[x] > heights[y])
        roots[y] = x;
    else roots[x] = y;

    if(heights[x] == heights[y])
        ++heights[y];
}

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

    cin >> n >> m;

    for(int i = 1 ; i <= n ; i++)
    {
        roots[i] = i;
        heights[i] = 1;
    }

    for(int i = 1 ; i <= m ; i++)
    {
        cin >> type >> x >> y;

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

    return 0;
}