#include <iostream>
#include <fstream>
using namespace std;

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

int n, m;
int Tata[100001];
int Rang[100001];

int Radacina(int x)
{
    if (Tata[x] == 0) return x;
    else
    {
        int r = Radacina(Tata[x]);
        Tata[x] = r;
        return r;
    }
}

void Unire(int x, int y)
{
    int rx = Radacina(x), ry = Radacina(y);
    if (rx != ry)
    {
        if (Rang[rx] > Rang[ry])
            Tata[ry] = rx;
        else
        {
            Tata[rx] = ry;
            if (Rang[rx] == Rang[ry])
                Rang[ry]++;
        }
    }
}

int main()
{
    fin >> n >> m;
   // for (int i = 1; i <= n; ++i)
     //   Tata[i] = i;
    int q, x, y;
    while (m--)
    {
        fin >> q >> x >> y;
        if (q == 1)
            Unire(x, y);
        else if (q == 2)
        {
            int rx = Radacina(x), ry = Radacina(y);
            if (rx == ry)
                fout << "DA\n";
            else
                fout << "NU\n";
        }

    }
}