#include<bits/stdc++.h>

using namespace std;

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

int t[100001], n, q;

int getRoot(int n) {
    if(t[n] == n)
        return n;
    t[n] = getRoot(t[n]);
    return t[n];
}

int main(){

    f>>n>>q;

    for(int i=1; i<=n; i++) 
        t[i]=i;
    while(q) {
        int x, y, cer;
        f>>cer>>x>>y;
        int rx = getRoot(x);
        int ry = getRoot(y);
        if(cer == 1) {
            t[rx] = ry;
        }
        else {
            if(rx == ry)
                g<<"DA"<<'\n';
            else 
                g<<"NU"<<'\n';
        }
        q--;
    }

    return 0;

}