#include <fstream>

using namespace std;

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

int t[100001],nr[100001];

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

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

void reunion(int x,int y)
{

    int rx=radacina(x),ry=radacina(y);
    if(nr[rx]>nr[ry])
    {
        t[ry]=rx;
        nr[rx]+=nr[ry];
    }
    else
    {
        t[rx]=ry;
        nr[ry]+=nr[rx];
    }
}

int main()
{
    int m,n,a,b,c;
    f>>n>>m;
    for(int i=1; i<=m; i++)
    {
        f>>c>>a>>b;
        if(c==1)
        {
            reunion(a,b);
        }
        if(c==2)
        {

            if(query(a,b))
                g<<"DA"<<"\n";
            else
                g<<"NU"<<"\n";
        }

    }
    return 0;
}