#include <fstream>
#include <vector>
#include <set>
#define INF 0x3f3f3f3f
using namespace std;

ifstream is("disjoint.in");
ofstream os("disjoint.out");

using VI = vector<int>;
using VVI = vector<VI>;

int n, m;
VI h, t;

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

int main()
{
    is >> n >> m;
    h = t = VI(n + 1);
    for ( int i = 1; i <= n; ++i )
        t[i] = i;
    int tip, x, y;
    while ( m-- )
    {
        is >> tip >> x >> y;
        if ( tip == 1 )
            Union(Find(x), Find(y));
        else
            os << ( Find(x) == Find(y) ? "DA" : "NU" ) << "\n";
    }
    is.close();
    os.close();
    return 0;
}

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

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