#include <bits/stdc++.h>
using namespace std;
ifstream fin ("disjoint.in");
ofstream fout ("disjoint.out");
int cod, x, y, t[100001], n, m, i;
int rad (int nod)
{
    while (t[nod]>0)
        nod=t[nod];
    return nod;
}
int main()
{
    fin>>n>>m;
    for (i=1; i<=m; i++)
    {
        fin>>cod>>x>>y;
        if (cod==2)
        {
            int rx=rad(x);
            int ry=rad(y);
            if (rx==ry)
                fout<<"DA\n";
            else
                fout<<"NU\n";
        }
        else
        {
            int rx=rad(x);
            int ry=rad(y);
            if (rx!=ry)
            {
                if (t[rx]==t[ry])
                {
                    t[ry]=rx;
                    t[rx]--;
                }
                if (-t[rx]>-t[ry])
                {
                    t[ry]=rx;
                }
                if (-t[rx]<-t[ry])
                {
                    t[rx]=ry;
                }
            }
        }
    }
}