#include <fstream>
#define NMAX 100005
using namespace std;

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

int n, m, type, x, y;
int Papa[NMAX], Rank[NMAX];

/*int Find(int a)
{
    int aux, b;
    for (aux = a; Papa[aux] != aux; aux = Papa[aux]);
    while (Papa[a] != a)
    {
        b = Papa[a];
        Papa[a] = aux;
        a = b;
    }
}*/

int main()
{
    in >> n >> m;
    while (m)
    {
        in >> type >> x >> y;
        switch(type)
        {
            case 1:
                while (Papa[x]) x = Papa[x];
                while (Papa[y]) y = Papa[y];
                Papa[y] = x;
                break;
            case 2:
                while (Papa[x]) x = Papa[x];
                while (Papa[y]) y = Papa[y];
                if (x == y)
                    out << "DA" << '\n';
                    else
                    out << "NU" << '\n';
                break;
        }
        --m;
    }
    return 0;
}