#include <fstream>
using namespace std;

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

const int N = 1e5 + 5;

int n, m, t[N];

int find(int &x) {
    if (t[x] != x)
        t[x] = find(t[x]);
    return t[x];
}

void unite(int &x, int &y) {
    t[min(find(x), find(y))] = max(find(x), find(y));
}

int main() {
    fin >> n >> m;
    for (int i = 1; i <= n; ++i)
        t[i] = i;
    while(m--) {
        int type, x , y;
        fin >> type >> x >> y;
        if (type == 1)
            unite(x, y);
        else
            fout << (find(x) == find(y) ? "DA\n" : "NU\n");
    }
}