#include <fstream>
#include <deque>
using namespace std;
ifstream cin("disjoint.in");
ofstream cout("disjoint.out");
const int nmax = 1e5 + 1;
deque <int> m[nmax];
int sz[nmax] , r[nmax] , n , q , op , a , b;
signed main()
{
    cin >> n;
    for(int i = 1 ; i <= n ; ++i)
    {
        sz[i] = 1;
        r[i] = i;
        m[i].push_back(i);
    }
    cin >> q;
    for(int i = 1 ; i <= q ; ++i)
    {
        cin >> op >> a >> b;
        if(op == 2)
        {
            if(r[a] == r[b]) cout << "DA\n";
            else cout << "NU\n";
        }
        else
        {
            if(r[a] == r[b]) continue;
            if(sz[r[a]] < sz[r[b]]) swap(a,b);
            sz[r[a]] += sz[r[b]];
            sz[r[b]] = 0;
            int asta = r[b];
            while(!m[asta].empty()) r[m[asta].back()] = r[a] , m[asta].pop_back();
        }
    }
	return 0;
}