#include <fstream>
using namespace std;

ifstream f("disjoint.in");
ofstream g("disjoint.out");
int n,m,x,y,c,t[100055],r[100055];

void reuniune(int x,int y)
{
    int a,b;

    a=t[x];
    b=t[y];

    if(r[a]<r[b])
        t[a]=b;
    else
        t[a]=b;

    if(r[a]==r[b])
        ++r[a];

}

int gasire_radacina(int x)
{
    if(t[x]==x)
        return x;
    else
        return t[x] = gasire_radacina(t[x]);
}

int main()
{

    f>>n>>m;
    for(int i=1;i<=n;i++)
    {
        t[i]=i;
        r[i]=0;
    }

    for(int i=1;i<=m;i++)
    {
        f>>c>>x>>y;
        if(c==1)
            reuniune(x,y);
        else
            if(gasire_radacina(x)==gasire_radacina(y))
                g<<"DA\n";
            else
                g<<"NU\n";
        }


    return 0;
}