#include <bits/stdc++.h>
using namespace std;

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

int t[100002];

int Find(int i){
    int k;
    k = i;
    while (t[k] > 0)
        k = t[k];
    while (t[i] > 0){
        t[i] = k;
        i = t[i];
    }
    return i;
}

void Union(int i, int j){
    t[j] = i;
}

int main()
{
    int i, m, n, x, y, rx, ry, op;
    fin >> n >> m;
    for (i = 1; i <= n; i++)
        t[i] = -1;
    for (i = 1; i <= m; i++){
        fin >> op >> x >> y;
        rx = Find(x);
        ry = Find(y);
        if (op == 1)
            Union(rx, ry);
        else
            if (rx == ry) fout << "DA\n";
            else fout << "NU\n";
    }
    return 0;
}