#include <iostream>
#include <fstream>
#include<stdio.h>
#include<string>
#include<algorithm>
#include<vector>
#include<set>
#include<map>

using namespace std;

#define x first
#define y second
#define NMAX 100005

using namespace std;

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

int father[NMAX], group[NMAX], n, m;

int findFather(int node)
{
    if(node == father[node])
    {
        return node;
    }
    int new_father = findFather(father[node]);
    father[node] = new_father;
    return new_father;
}

int main ()
{
    int a, b, tip;

	f >> n >> m;

    for(int i = 1; i <= n; i++)
    {
        father[i] = i;
        group[i] = 1;
    }

    for(int i = 1; i <= m; i++)
    {
        f >> tip >> a >> b;
        int fa = findFather(a);
        int fb = findFather(b);
        if(tip == 1)
        {
            if(fa == fb)
            {
                continue;
            }
            if(group[fa] > group[fb])
            {
                father[fb] = fa;
                group[fa] += group[fb];
            }
            else
            {
                father[fa] = fb;
                group[fb] += group[fa];
            }
        }
        else
        {
            if(fa == fb)
            {
                g << "DA\n";
            }
            else
            {
                g << "NU\n";
            }
        }
    }

    return 0;
}