#include <bits/stdc++.h>
#define N 100001

using namespace std;

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

int n, m, tata[N + 2], h[N + 2];

void init()
{
    for(int i = 1; i <= n; i++)
        tata[i] = i;
}

int Find(int x)
{
    if(tata[x] == x)
        return x;
    tata[x] = Find(tata[x]);
    return tata[x];
}

void Union(int x, int y)
{
    int a = Find(x), b = Find(y);
    if(h[a] < h[b])
        tata[a] = b;
    else
    {
        tata[b] = a;
        if(h[a] == h[b])
            ++h[a];
    }
}

int main()
{
    fin >> n >> m;

    int cod, x, y;

    init();

    for(int i = 1; i <= m; i++)
    {
        fin >> cod >> x >> y;

        if(cod == 1)
            Union(x, y);
        else
        {
            int a = Find(x), b = Find(y);
            if(a == b)
                fout << "DA\n";
            else fout << "NU\n";
        }
    }

    return 0;
}