#include <bits/stdc++.h>
#include <unordered_map>
#include <map>

using namespace std;

ifstream fin("disjoint.in");
ofstream fout("disjoint.out");

//-----------------------------------------
#define ll long long
#define pii pair<int, int>
#define pll pair<long long, long long>
#define vi vector<int>
#define vll vector<long long>
#define mii map<int, int>
#define si set<int>
#define sc set<char>
//-----------------------------------------
#define f(i,s,e) for(int i=s;i<=e;++i)
#define nf(i,s,e) for(i=s;i<e;++i)
#define rf(i,e,s) for(i=e;i>=s;--i)
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define sp <<" "
//------------------------------------------
const int NMAX = 1e2 + 5;
const int MOD = 1e9 + 7;
const int INF = 0x3f3f3f3f;
//------------------------------------------
int n, m;
vi t;
//-----------------------------------------
void read() {
    fin >> n >> m;
    t.resize(n + 5);
}
int Find(int x) {
    int root = x, y;
    while (t[root])
        root = t[root];
    while (x != root) {
        y = t[x];
        t[x] = root;
        x = y;
    }
    return root;
}
void Union(int x, int y) {
    t[y] = x;
}
void solve() {
    for (int i = 1; i <= m; ++i) {
        int task, x, y;
        fin >> task >> x >> y;
        int r1 = Find(x), r2 = Find(y);
        if (task == 1) {
            if (r1 != r2) Union(r1, r2);
        }
        else {
            if (r1==r2)
                fout << "DA\n";
            else
                fout << "NU\n";
        }
    }
}
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    read();
    solve();
    return 0;
}