#include <bits/stdc++.h>
using namespace std;

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

int p[100001],n,m;
///------------------------------------------
void Union(int x,int y)
{
    p[x]=y;
}
///------------------------------------------
int Find(int x)
{
    if ( x != p[x] )
        p[x] = Find(p[x]);
    return p[x];
}
///-------------------------------------------
int main()
{
    fin>>n>>m;

    for(int i=1;i<=n;i++)
        p[i]=i;

    for(int i=1;i<=m;i++)
    {
        int tip,x,y;
        fin>>tip>>x>>y;

        if(tip==1)
        Union(Find(x),Find(y));
        if(tip==2)
            if(Find(x)==Find(y))
            fout<<"DA\n";
        else
            fout<<"NU\n";


    }


    return 0;
}