#include <bits/stdc++.h>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");

int n, m, x, y, cod, r[100005], t[100005];

int Find(int x)
{
    int y;
    if (t[x] == 0)
        return x;
    y = Find(t[x]);
    t[x] = y;
    return y;
}

void Reunion(int x, int y)
{
    if (r[x] > r[y])
    {
        t[y] = x;
        r[x] += r[y];
    }
    else
    {
        t[x] = y;
        r[y] += r[x];
    }
}

int main()
{
    int i;
    fin >> n >> m;
    for (i = 1 ; i <= n ; i++)
        r[i] = 1;
    while (m--)
    {
        fin >> cod >> x >> y;
        x = Find(x);
        y = Find(y);
        if (cod == 1)
            Reunion(x, y);
        else
        {
            if (x == y)
                fout << "DA" << "\n";
            else
                fout << "NU" << "\n";
        }
    }
}