#include <fstream>
#define Xp 100002
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int i,n,m,caz,x,y,tree[Xp],rang[Xp];
int loc(int x)
{
    int R,Y;
    for(R=x;tree[R]!=R;R=tree[R]);
    for(;tree[x]!=x;)
    {
        Y=tree[x];
        tree[x]=R;
        x=Y;
    }
    return R;
}
void unite(int x,int y)
{
    if(rang[x]<rang[y]) tree[x]=y;
        else tree[y]=x;
    if(rang[x]==rang[y]) ++rang[y];
}
int main()
{
    f>>n>>m;
    for(i=1;i<=n;++i)
    {
        tree[i]=i;
        rang[i]=1;
    }
    for(i=1;i<=m;++i)
    {
        f>>caz>>x>>y;
        if(caz==2)
        {
            if(loc(x)==loc(y)) g<<"DA"<<'\n';
                else g<<"NU"<<'\n';
        }
            else unite(loc(x),loc(y));
    }
    g.close();
    return 0;
}