#include <iostream>
#include <fstream>

using namespace std;

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

int v[100010], n, m, k, a, b;

int find_(int x)
{
    if(v[x]<0)
        return x;
    else
        return x=find_(v[x]);
}
void union_(int a, int b)
{
    int parenta=find_(a);
    int parentb=find_(b);
    if(v[parenta]<v[parentb])
    {
        v[parenta]=parentb;
    }
    else if(v[parenta]>v[parentb])
    {
        v[parentb]=parenta;
    }
    else if(v[parenta]==v[parentb])
    {
        v[parentb]=parenta;
        v[parenta]--;
    }
}

int main()
{
   fin>>n>>m;
   for(int i=1;i<=n;i++)
   v[i]=-1;
   for(int i=1;i<=m;i++)
   {
       fin>>k>>a>>b;
       if(k==1)
       {
        union_(a,b);
       }
       else
       {
        if(find_(a)==find_(b))
            fout<<"DA"<<'\n';
        else fout<<"NU"<<'\n';
       }
   }

    return 0;
}