#include <fstream>

using namespace std;

int t[100005], nr[100005], n;

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

    t[x] = rad(t[x]);
    return t[x];
}

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

bool verificare(int x, int y)
{
    return (rad(x) == rad(y));
}

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

    int m;

    fin >> n >> m;

    for (int i = 1; i <= n; i++)
        nr[i] = 1;

    for (int i = 0; i < m; i++)
    {
        int cod, x, y;
        fin >> cod >> x >> y;

        if (cod == 1)
            reuniune(x, y);

        else
            if (verificare(x, y))
                fout << "DA\n";
            else
                fout << "NU\n";
    }

    return 0;
}