#include <bits/stdc++.h>
using namespace std;

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

const int MAX = 1e5 + 5;

int n, m;
int dad[MAX], nr[MAX];

int Dad(int x)
{
    if(x != dad[x])
        x = Dad(dad[x]);
    return dad[x];
}

void unite(int x, int y)
{
    x = Dad(x);
    y = Dad(y);

    if(nr[x] < nr[y])
    {
        nr[y] += nr[x];
        dad[x] = y;
    }
    else
    {
        nr[x] += nr[y];
        dad[y] = x;
    }
}

int main()
{
    f >> n >> m;

    for(int i = 1; i <= n; ++i)
        dad[i] = i, nr[i] = 1;
    while(m--)
    {
        int type, x, y;
        f >> type >> x >> y;

        if(type == 1)
            unite(x, y);
        else
            g << (Dad(x) == Dad(y) ? "DA" : "NU") << "\n";
    }
    return 0;
}