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

int n, m;
ifstream fin ("disjoint.in");
ofstream fout ("disjoint.out");

struct dsu
{
    vector <int> p, sz;
    dsu()
    {
        p.resize(n + 1);
        sz.resize(n + 1);
        for (int i = 1; i <= n; i++)
        {
            p[i] = i;
            sz[i] = 1;
        }
    }
    int find_parent(int node)
    {
        if (p[node] == node)
            return node;
        return p[node] = find_parent(p[node]);
    }
    void unite(int x, int y)
    {
        x = find_parent(x);
        y = find_parent(y);
        if (x == y)
            return;
        if (sz[x] > sz[y])
            swap(x, y);
        p[x] = y;
        sz[y] += sz[x];
    }
};

int main()
{
    fin >> n >> m;
    dsu tree;
    for (int i = 1; i <= m; i++)
    {
        int t, x, y;
        fin >> t >> x >> y;
        if (t == 1)
            tree.unite(x, y);
        else
            if (tree.find_parent(x) == tree.find_parent(y))
                fout << "DA\n";
            else
                fout << "NU\n";
    }
    return 0;
}