#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define MOD 1000000007

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef double ld;

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

int n, m;
int group[100010], rang[100010];

int find(int x) {
    int r;
    for (r = group[x]; r != group[r]; r = group[r]);

    while (group[x] != x) {
        int aux = group[x];
        group[x] = r;
        x = aux;
    }

    return r;
}

void unite(int x, int y) {
    if (rang[x] > rang[y]) {
        group[y] = x;
    } else {
        group[x] = y;
    }

    if (rang[x] == rang[y]) {
        rang[y]++;
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    
    fin >> n >> m;

    for (int i = 1; i <= n; i++) {
        group[i] = i;
        rang[i] = 1;
    }

    while (m--) {
        int op, x, y;
        fin >> op >> x >> y;
        if (op == 1) {
            unite(find(x), find(y));
        } else {
            if (find(x) == find(y)) {
                fout << "DA\n";
            } else {
                fout << "NU\n";
            }
        }
    }
    
    return 0;
}