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

ifstream f("disjoint.in");
ofstream g("disjoint.out");

int v[100005];

int radacina(int a){
    while (v[a] != 0)
        a = v[a];
    return a;

}


int main(){

    int n, m, cod, x, y;

    f >> n >> m;

    for (int i = 0; i < m; i++){

        f>> cod >> x >> y;

        if (cod == 1)

            v[radacina(y)] = radacina(x);

        else if (radacina(x) == radacina(y))

            g << "DA\n";

        else

            g << "NU\n";

    }

    return 0;

}