#include <fstream>
#include <vector>
using namespace std;

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

int n, m;
vector<int> t, h;

void Union(int x, int y);
int Find(int x);

int main()
{
    fin >> n >> m;
    t.resize(n + 1);
    h.resize(n + 1);
    for ( int i = 1; i <= n; ++i )
        t[i] = i, h[i] = 0;
    int op, a, b;
    for ( int i = 1; i <= m; ++i )
    {
        fin >> op >> a >> b;
        if ( op == 1 )
            Union(Find(a), Find(b));
        if ( op == 2 )
        {
            if ( Find(a) == Find(b) )
                fout << "DA" << '\n';
            else
                fout << "NU" << '\n';
        }
    }
    fin.close();
    fout.close();
    return 0;
};


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

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