#include <iostream>
#include <fstream>
#define Nmax 100005

using namespace std;

ifstream f("disjoint.in");
ofstream g("disjoint.out");

int n, m, op, x, y;
int tt[Nmax], rg[Nmax];

int root(int x)
{
    int r=x, y=0;
    while(tt[r]!=r) r=tt[r];

    while(x!=tt[x])
    {
        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[x]++;
}

int main()
{
    f >> n >> m;

    for (int i = 1; i <= n; i++)
    {
        tt[i]=i;
        rg[i]=1;
    }

    while(m--)
    {
        f >> op >> x >> y;
        if(x>y) swap(x, y);
        if(op == 1)  unite(root(x), root(y));
        else
        {
            int X=root(x);
            int Y=root(y);
            if(X==Y) g << "DA\n";
            else g << "NU\n";
        }
    }

    return 0;
}