#include <fstream>

using namespace std;

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

int t[100005];
int x,y,n,m,i,rx,ry,tip;

int rad (int x)
{
    int r = 0;
    while (t[x] > 0)
        x = t[x];
    r = x;
    return r;
}

int main()
{
    fin >> n >> m;
    for (i=1; i<=n; i++)
        t[i] = -1;
    for (i=1; i<=m; i++)
    {
        fin >> tip >> x >> y;
        rx = rad(x);
        ry = rad(y);
        if (tip == 1)
        {
            if (rx != ry)
            {
                if (t[rx] < t[ry])
                {
                    t[rx] += t[ry];
                    t[ry] = rx;
                }
                else
                {
                    t[ry] += t[rx];
                    t[rx] = ry;
                }
            }
        }
        else
            if (rx == ry)
                fout << "DA" << "\n";
            else
                fout << "NU" << "\n";
    }
    return 0;
}