#include <iostream>

using namespace std;

int p[100001], l[100001];
int g(int x)
{
  if(p[x]==x)
    return x;
  return p[x]=g(p[x]);
}
void u(int x, int y)
{
  int gx=g(x), gy=g(y);
  if(l[gx]>l[gy])
    p[gy]=gx;
  else if(l[gx]<l[gy])
    p[gx]=gy;
  else
  {
    p[gx]=gy;
    l[gy]++;
  }
}
int main()
{
    ifstream cin("disjoint.in");
    ofstream cout("disjoint.out");
    int n, m, cer, x, y;
    cin>>n>>m;
    for(int i=1; i<=n; i++)
    {
      p[i]=i;
      l[i]=1;
    }
    for(int i=0; i<m; i++)
    {
      cin>>cer>>x>>y;
      if(cer==1)
        u(x, y);
      else
      {
        if(g(x)==g(y))
          cout<<"DA";
        else
          cout<<"NU";
        cout<<'\n';
      }
    }
    return 0;
}