#include <bits/stdc++.h>

using namespace std;

vector <int> parent, height;

int n, m;

int findParent(int x)
{
    if(x == parent[x])
        return x;
    return parent[x] = findParent(parent[x]);
}


void mergeUnion(int a, int b)
{
    int parentA = findParent(a);
    int parentB = findParent(b);

    if(height[parentA] < height[parentB])
        swap(parentA, parentB);
    parent[parentB] = parentA;
    if(height[parentA] == height[parentB])
        height[parentA] ++;
}

int main()
{
    ios_base :: sync_with_stdio(0);
    cin.tie(0);

    freopen("disjoint.in", "r", stdin);
    freopen("disjoint.out", "w", stdout);

    cin >> n >> m;
    parent.resize(n + 1);
    height.resize(n + 1, 1);

    for(int i = 1; i <= n; i ++)
        parent[i] = i;

    for(int i = 1; i <= m; i ++)
    {
        int x, a, b;
        cin >> x >> a >> b;

        if(x == 1)
        {
            mergeUnion(a, b);
        }
        else
        {
            if(findParent(a) == findParent(b))
                cout << "DA\n";
            else
                cout << "NU\n";
        }
    }

    return 0;
}