#include <fstream>
#include <vector>
using namespace std;
ifstream cin("disjoint.in");
ofstream cout("disjoint.out");
vector<int> parent, rang;
int n, m, x, y;
short int c;
int findroot(int node)
{
    if(parent[node] == node)
        return node;
    parent[node] = findroot(parent[node]);
    return parent[node];
}
void unionset(int node1, int node2)
{
    node1 = findroot(node1);
    node2 = findroot(node2);
    if(node1 == node2)
        return;
    if(rang[node1] < rang[node2])
        swap(node1, node2);
    if(rang[node1] == rang[node2])
        rang[node1]++;
    parent[node2] = node1;
}
int main()
{
    cin >> n >> m;
    parent.resize(n+1);
    rang.resize(n+1);
    for(int i=1; i<=n; i++)
    {
        parent[i] = i;
        rang[i] = 1;
    }
    while(m--)
    {
        cin >> c >> x >> y;
        if(c == 1)
            unionset(x, y);
        else
            if(findroot(x) != findroot(y))
                cout << "NU" << '\n';
            else
                cout << "DA" << '\n';
    }
    return 0;
}