#include <fstream>

using namespace std;

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

int N, M;
int T[100001], R[100001];

int find(int nr)
{
    int rad, x;

    for (rad = nr; T[rad] != rad; rad = T[rad]);

    for (; T[nr] != nr; )
    {
        x = T[nr];
        T[nr] = rad;
        nr = x;
    }

    return rad;
}

void unite(int x, int y)
{
    if (R[x] > R[y]) T[y] = x;
    else T[x] = y;

    if (R[x] == R[y]) ++R[y];
}

int main()
{
    fin >> N >> M;
    for (int i = 1; i <= N; ++i)
    {
        T[i] = i;
        R[i] = 1;
    }
    for (int i = 1, cod, x, y; i <= M; ++i)
    {
        fin >> cod >> x >> y;
        {
            int nr1 = find(x);
            int nr2 = find(y);
            if (cod == 1) unite(nr1, nr2);
            else
            {
                if (nr1 == nr2) fout << "DA\n";
                else fout << "NU\n";
            }
        }
    }

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