#include <fstream>
#include <cstring>
#include <algorithm>
using namespace std;

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

const int MAXN = 100005;
int n, m;
int r[MAXN], v[MAXN];

void unite(int x, int y) {

    if (r[x] >= r[y]) {
        v[y] = v[x];
    }
    else {
        v[x] = v[y];
    }
    if (r[x] == r[y]) {
        r[x]++;
    }
}

int find(int x) {
    int r, t;
    for (r = v[x]; r != v[r]; r = v[r]);
    while (x != r) {
        int y = v[x];
        v[x] = r;
        x = y;
    }
    return r;
}

int main() {

    fin >> n >> m;
    for (int i = 1; i <= n; ++i) {
        r[i] = 1;
        v[i] = i;
    }

    for (int i = 1; i <= m; ++i) {
        int a, b, c;
        fin >> a >> b >> c;
        if (a == 1) {
            unite(b, c);
        }
        else {
            if (find(b) == find(c)) {
                fout << "DA\n";
            }
            else {
                fout << "NU\n";
            }
        }
    }

    fout.close();
    return 0;
    }