#include <fstream>
#include <algorithm>

using namespace std;

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

int sub[100001], n, m, ex;

int main()
{
    int p, x, y;
    in>>m>>n;
    for(int i=1; i<=m; i++)
        sub[i]=i;
    for(int i=1; i<=n; i++)
    {
        in>>p>>x>>y;
        if(p==1)
        {
            if(sub[x]!=sub[y])
            {
                ex=sub[y];
                for(int j=1; j<=n; j++)
                    if(sub[j]==ex)
                        sub[j]=sub[x];
            }
        }
        else if(sub[x]==sub[y])
            out<<"DA"<<'\n';
        else out<<"NU"<<'\n';
    }
    return 0;
}