#include <bits/stdc++.h>

using namespace std;

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

int n, m, i, cerinta, radx, rady, x, y;
int t[100005];

inline int radacina (int a){
    while (t[a] > 0){
       a = t[a];
    }
    return a;
}

int main(){
    fin >> n >> m;
    for (i=1; i<=n; i++)
        t[i] = -1;
    for (i=1; i<=m; i++){
        fin >> cerinta >> x >> y;
        radx = radacina (x), rady = radacina (y);
        if (cerinta == 2){
            if (radx == rady){
                fout << "DA\n";
            }
            else{
                fout << "NU\n";
            }
        }
        else{
            if (radx != rady){
                if (t[radx] < t[rady]){
                    t[radx] += t[rady];
                    t[rady] = radx;
                }
                else{
                    t[rady] += t[radx];
                    t[radx] = rady;
                }
            }
        }
    }
    return 0;
}
/** recapitulare **/