#include <bits/stdc++.h>

using namespace std;

ifstream fin("disjoint.in");
ofstream fout("disjoint.out");

const int nmax = 100005;
int n, m;
int tt[nmax], rang[nmax];

inline int findset(int x)
{
    if (x != tt[x])
        tt[x] = findset(tt[x]);
    return tt[x];
}

inline void unite(int a, int b)
{
    int x = findset(a);
    int y = findset(b);
    if (x == y)
        return;
    if (rang[x] < rang[y])
        tt[x] = y;
    else if (rang[x] > rang[y])
        tt[y] = x;
    else
        tt[x] = y, rang[x]++;
}

int main()
{
    fin >> n >> m;
    for (int i = 1; i <= n; i++)
        rang[i] = 1, tt[i] = i;
    while (m--)
    {
        int p, a, b;
        fin >> p >> a >> b;
        if (p == 1)
            unite(a, b);
        else
            if (findset(a) == findset(b))
                fout << "DA\n";
            else
                fout << "NU\n";
    }
    return 0;
}