#include <fstream>
using namespace std;

int n, m, PA[100001];

int radacina(int a) {
    int r = a, aux;
    while(PA[a] != a)
        a = PA[a];
    while(PA[r] != r) {
        aux = PA[r];
        PA[r] = a;
        r = aux;
    }
    return a;
}


int main() {
    int i, t, a, b;
    ifstream f("disjoint.in");
    ofstream g("disjoint.out");
    f >> n >> m;
    for(i = 1; i <= n; ++i)
        PA[i] = i;
    for(i = 1; i <= m; ++i) {
        f >> t >> a >> b;
        if(t == 1)
            PA[b] = a;
        else if(radacina(a) == radacina(b))
            g << "DA\n";
        else
            g << "NU\n";
    }
    g.close();
    return 0;
}