#include <bits/stdc++.h>

using namespace std;

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

int t[100001];

void Union(int x, int y)
{
    t[y] = x;
}

int Find(int x)
{
    int rad = x, y;

    while(t[rad] != 0)
        rad = t[rad];

    while(x != rad)
    {
        y = t[x];
        t[x] = rad;
        x = y;
    }
    return rad;
}

int n, m, x, y, p, q, op;

int main()
{
    fin >> n >> m;
    for(int i = 1 ; i <= m ; ++i)
    {
        fin >> op >> x >> y;
        p = Find(x);
        q = Find(y);
        if(op == 1)
        {
            if(p != q) Union(x, y);
        }
        else
        {
            if(p == q) fout << "DA\n";
            else fout << "NU\n";
        }
    }
    return 0;
}