#include <fstream>
#include <vector>
#include <queue>
#include <bitset>
using namespace std;
string file = "disjoint";
ifstream cin (file + ".in");
ofstream cout (file + ".out");
const int N = 100000;
int t[N+1], nr[N+1];

int radacina (int x)
{
    if (t[x] == 0)
    {
        return x;
    }
    t[x] = radacina(t[x]);
    return t[x];
}
int main()
{
    int n,m,op,x,y;
    cin >> n >> m;
    for (int i=1; i<=m; i++)
    {
        cin >> op >> x >> y;
        int rx = radacina(x);
        int ry = radacina(y);
        if (op == 1)
        {
            if (nr[ry] >= nr[rx])
            {
                t[ry] = rx;
                nr[ry] += nr[rx];
            }
            else
            {
                t[rx] = ry;
                nr[rx] += nr[ry];
            }
        }
        else
        {

            if (rx == ry)
            {
                cout << "DA\n";
            }
            else
            {
                cout << "NU\n";
            }
        }
    }
}