#include <fstream>

using namespace std;

ifstream in("disjoint.in");
ofstream out("disjoint.out");

const int N=1e5+1;

int nrd[N],t[N];

int radacina(int x)
{
    if(t[x]==0)
    {
        return x;
    }
    t[x]=radacina(t[x]);
    return t[x];
}

bool verif(int x, int y)
{
    return (radacina(x)==radacina(y));
}

void reuniune(int x, int y)
{
    int rx=radacina(x);
    int ry=radacina(y);
    if(nrd[rx]<nrd[ry])
    {
        t[rx]=ry;
        nrd[ry]+=nrd[rx];
    }
    else
    {
        t[ry]=rx;
        nrd[rx]+=nrd[ry];
    }
}

int main()
{
    int n,m,c,x,y;
    in>>n>>m;
    for(int i=1; i<=n; i++)
    {
        nrd[i]=1;
    }
    for(int i=1; i<=m; i++)
    {
        in>>c>>x>>y;
        if(c==1)
        {
            reuniune(x, y);
        }
        else
        {
            if(verif(x, y)) out<<"DA\n";
            else out<<"NU\n";
        }
    }
    return 0;
}