#include <fstream>
#include <vector>
#include <iostream>
#include <queue>
#define inf 0x3f3f3f3f
#define NM 250005
using namespace std;

ifstream f("disjoint.in");
ofstream g("disjoint.out");
int n, m,gr[100005], r[100005];

int Find(int x)
{
    int y = x, aux;
    for(x; x != gr[x]; x = gr[x]);
    for(y; y != gr[y];)
    {
        aux = gr[y];
        gr[y] = x;
        y = aux;
    }
    return x;
}

void Union(int i, int j)
{
    if(r[i] > r[j]) gr[j] = i;
    else gr[i] = j;
    if(r[i] == r[j]) r[j]++;
}

int main()
{
    int cod, x, y;
    f >> n >> m;
    for(int i = 1; i <= n; ++i)
    {
        gr[i] = i;
        r[i] = 1;
    }
    for(int i = 1; i <= m; ++i)
    {
        f >> cod >> x >> y;
        if(cod == 1) Union(Find(x), Find(y));
        else
        {
            if(Find(x) == Find(y)) g << "DA" << '\n';
            else g << "NU" << '\n';
        }

    }
}