#include <iostream>
#include <fstream>
#include <deque>

using namespace std;

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

int n, m, t[100005], rang[100005];

int radacina(int k)
{
    while(t[k] != k)
        k = t[k];
    return k;
}

void unire(int x, int y)
{
    if(rang[x] > rang[y])
        t[y] = x;
    else
    {
        t[x] = y;
        if(rang[x] == rang[y])
            rang[y]++;
    }
}

int main()
{
    fin >> n >> m;
    for(int i = 1; i <= n; i++)
        t[i] = i;
    for(int i = 1; i <= m; i++)
    {
        int o, x, y;
        fin >> o >> x >> y;
        if(o == 1)
        {
            unire(radacina(x), radacina(y));
        }
        else
        {
            if(radacina(x) != radacina(y))
                fout << "NU" << '\n';
            else
                fout << "DA" << '\n';
        }
    }
}