#include <iostream>
#include <fstream>
#define NMAX 100010

using namespace std;

int father[NMAX];

int findFather(int k)
{
    if (father[k] == k)
        return k;
    return findFather(father[k]);
}

int main()
{
    ifstream fin("disjoint.in");
    ofstream fout("disjoint.out");
    int n, m, k, x, y, value;
    fin >> n >> m;
    for (int i=1; i<=n; i++)
        father[i] = i;
    for (int i=1; i<=m; i++)
    {
        fin >> k >> x >> y;
        if (k == 1)
            father[y] = findFather(x);
        else
        {
            if (father[x] != father[y])
                fout << "NU\n";
            else
                fout << "DA\n";
        }
    }
    return 0;
}