#include <fstream>
using namespace std;

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

int n, m, op, x, y, t[100005], rx, ry;

int find_radacina (int nod)
{
    if (t[nod]==nod)
        return nod;
    else
        return find_radacina(t[nod]);
}

int main()
{
    int i;

    fin>>n>>m;

    for (i=1; i<=n; i++)
    {
        t[i]=i;
    }

    for (i=1; i<=m; i++)
    {
        fin>>op>>x>>y;

        if (op==1)
        {
            rx=find_radacina(x);
            ry=find_radacina(y);

            t[ry]=rx;
        }
        else
        {
            rx=find_radacina(x);
            ry=find_radacina(y);

            if (rx==ry)
                fout<<"DA \n";
            else
                fout<<"NU \n";
        }
    }

    fin.close();
    fout.close();
    return 0;
}