#include <fstream>
#define maxn 100020
using namespace std;

int TT[maxn],RG[maxn];
int n,m;
ifstream in("disjoint.in");
ofstream out("disjoint.out");
int find(int x)
{
    int R;
    for(R=x;R!=TT[R];R=TT[R]); //gasesc radacina nodului x

    while(TT[x]!=x)
    {
        int y=TT[x];
        TT[x]=R;
        x=y;
    }
    return R;
}

void unite(int x,int y)
{
    if(RG[x]>RG[y])
      TT[y]=x;
      else TT[x]=y;

    if(RG[x]==RG[y]) RG[y]++;
}
int main()
{
    in>>n>>m;
    int x,y,z;
    for(int i=1;i<=n;i++)
    RG[i]=1,TT[i]=i;
    for(int i=1;i<=m;i++)
    {
        in>>x>>y>>z;
        if(x==1) unite(find(y),find(z));

        else
        {
            if(find(y)==find(z)) out<<"DA\n";
            else out<<"NU\n";
        }
    }

    return 0;
}