#include <fstream>
using namespace std;

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

int t[100002], rang[100002];
int FindR(int x);
void Add(int x, int y);

int n, m, op, x, y;

int main()
{
    is >> n >> m;
    for ( int i = 1; i <= n; ++i )
    {
        rang[i] = 1;
        t[i] = i;
    }
    while ( m-- )
    {
        is >> op >> x >> y;
        if ( op == 2 )
        {
            if ( FindR(x) == FindR(y) )
                os << "DA\n";
            else
                os << "NU\n";
        }
        else
            Add(x, y);
    }
    is.close();
    os.close();
    return 0;
}
int FindR(int x)
{
    if ( t[x] == x )
        return x;
    int rd = FindR(t[x]);
    t[x] = rd;
    return rd;
}
void Add(int x, int y)
{
    int r1 = FindR(x);
    int r2 = FindR(y);
    if ( rang[r1] < rang[r2] )
        t[r1] = r2;
    else
    {
        t[r2] = r1;
        if (rang[r1] == rang[r2])
            rang[r1]++;
    }
}