#include <iostream>
#include <fstream>
#include <vector>

using namespace std;



struct DSU {
    int N;
    vector<int> parent;

    void init(int n)
    {
        N = n;
        parent.resize(N + 1);
        for (int i = 1; i <= n; i++)
        {
            parent[i] = i;
        }
    }
    int find (int u)
    {
        if (u == parent[u])
        {
            return u;
        }
        return parent[u] = find (parent[u]);
    }
    void unite (int u, int v)
    {
        u = find(u);
        v = find(v);
        if (u != v)
        {
            parent[v] = u;
        }

    }
};

int main ()
{
    ifstream cin ("disjoint.in");
    ofstream cout("disjoint.out");
    int n, m, k, x, y;
    struct DSU dsu;
    dsu.init(n);
    cin >> n >> m;
    for (int i = 1; i <= m; i ++)
    {
        cin >> k >> x >> y;
        if (k == 1)
        {
            dsu.unite (x, y);
        }
        if (k == 2)
        {
            if (dsu.find(x) == dsu.find(y))
                cout << "DA" << '\n';
            else
                cout << "NU" << '\n';
        }
    }
    return 0;
}