#include <fstream>

using namespace std;

const int N = 1e5;

int t[N+1], nr[N+1];

int radacina(int x)
{
    if (t[x] == 0)
    {
        return x;
    }
    ///compactare: aflam radacina si inainte de return il legam pe x direct de radacaina
    t[x] = radacina(t[x]);
    return t[x];
}

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

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

int main()
{
    ifstream in("disjoint.in");
    ofstream out("disjoint.out");
    int n, q;
    in >> n >> q;
    ///initializam vectorul nr
    for (int i = 1; i <= n; i++)
    {
        nr[i] = 1;
    }
    for (int i = 1; i <= q; i++)
    {
        int tip, x, y;
        in >> tip >> x >> y;
        if (tip == 1)
        {
            reuniune(x, y);
        }
        else
        {
            if (verif(x, y))
            {
                out << "DA\n";
            }
            else
            {
                out << "NU\n";
            }
        }
    }
    in.close();
    out.close();
    return 0;
}