#include <bits/stdc++.h>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int t[100010],n,m,i,x,y,c;
int fnd(int x)
{
    while(t[x]!=x)
        x=t[x];
    return x;
}
void unit(int x, int y)
{
    x=fnd(x);
    y=fnd(y);
    t[x]=y;
}
int main()
{
    fin>>n>>m;
    for(i=1;i<=n;i++)
        t[i]=i;
    for(i=1;i<=m;i++)
    {
        fin>>c>>x>>y;
        if(c==1)
            unit(x,y);
        if(c==2)
            if(fnd(x)==fnd(y))
                fout<<"DA"<<'\n';
            else
                fout<<"NU"<<'\n';
    }
    return 0;
}