#include <iostream>
#include <fstream>
#include <cstdlib>
using namespace std;
int dad[100010];
int Find (int x)
{
    if(dad[x]==x)
        return x;
    dad[x]=Find(dad[x]);
    return dad[x];
}
void Union (int x, int y)
{
    int i,j;
    i=Find(x);
    j=Find(y);
    if(rand()%2==1)
        dad[i]=j;
    else
        dad[j]=i;
}
int main()
{
    ifstream fin ("disjoint.in");
    ofstream fout ("disjoint.out");
    int n,m,i,x,y,q;
    fin>>n>>m;
    for(i=1;i<=n;i++)
        dad[i]=i;
    for(i=1; i<=m; i++)
    {
        fin>>q>>x>>y;
        if(q==1)
            Union(x,y);
        else
        {
            if(Find(x)==Find(y))
                fout<<"DA\n";
            else
                fout<<"NU\n";
        }
    }
    return 0;
}