#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(WHATEVER) for(int i = 1; i <= WHATEVER; ++ i)

/// INPUT / OUTPUT
const string problem = "disjoint";
ifstream fin(problem + ".in");
ofstream fout(problem + ".out");

/// GLOBAL VARIABLES
const ll NMAX = 1e5+5, MOD = 1e9 + 7, INF = 1e9;
int n, q;
int sets[NMAX], parent[NMAX];

/// SOLUTION
inline int Find(int x)
{
    if(parent[x] == x)
        return x;
    return parent[x] = Find(parent[x]);
}

inline void Union(int x, int y)
{
    int parx = Find(x), pary = Find(y);
    if(sets[parx] < sets[pary])
    {
        swap(x, y);
        swap(parx, pary);
    }
    sets[parx] += sets[pary];
    parent[pary] = parx;
}

/// READING THE INPUT
int main()
{
    ios::sync_with_stdio(false);
    fin.tie(NULL);
    fout.tie(NULL);
    fin >> n >> q;
    for(int i = 1; i <= n; ++ i)
    {
        sets[i] = 1;
        parent[i] = i;
    }
    while(q--)
    {
        int tip, x, y;
        fin >> tip >> x >> y;
        if(tip == 1)
        {
            Union(x, y);
        }
        else
        {
            (Find(x) == Find(y)) ? fout << "DA\n" : fout << "NU\n";
        }
    }
}