#include <fstream>
#define nmax 100010

using namespace std;

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

int rad[nmax], rang[nmax], n, m, x, y;

int fnd(int x){
    int R, y;
    for (R = x; rad[R] != R; R = rad[R]);

    while (rad[x] != x){
        y = rad[x];
        rad[x] = R;
        x = y;
    }
    return R;
}

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

int main()
{
    fin >> n >> m;
    for (int i = 1; i <= n; i++){
        rad[i] = i;
        rang[i] = 1;
    }
    for (int i = 1; i <= m; i++){
        int t;
        fin >> t >> x >> y;
        if (t == 1)
            unite(fnd(x), fnd(y));
        if (t == 2)
            if (fnd(x) == fnd(y)) fout << "DA" << '\n';
                else fout << "NU" << '\n';
    }
    return 0;
}