#include <fstream>
using namespace std;
ifstream fin ("disjoint.in");
ofstream fout ("disjoint.out");

int n,i,m,rx,ry,f[100001],x,j;

int rad (int t) {

    while (f[t]>0)
        t=f[t];
    return t;

}

int main () {

    fin>>n>>m;
    for (i=1;i<=n;i++)
        f[i]=-1;


    while (m--) {
        fin>>x>>i>>j;
        rx=rad(i);
        ry=rad(j);
        if (x==2){
            if (rx==ry)
                fout<<"DA\n";
            else
                fout<<"NU\n";
        }
        if (x==1){
            if (rx != ry) {
                if (f[rx]<=f[ry]) {
                    f[rx]+=f[ry];
                    f[rx]=ry;
                }else {
                    f[ry]+=f[rx];
                    f[ry]=rx;
                }
            }
        }
    }


    return 0;
}