#include <fstream>
using namespace std;

#define NMax 100005

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

int n,m;
int tata[NMax],R[NMax];

int query(int x)
{
    if(!tata[x]) return x;
    else tata[x]=query(tata[x]);
}

void update(int x,int y)
{
    if(x<y) tata[x]=y;
    else tata[y]=x;
}

int main()
{
    int i;
    int cod,x,y;

    f>>n>>m;

    for(i=1;i<=n;i++) R[i]=1;

    for(i=1;i<=m;i++)
    {
        f>>cod>>x>>y;
        if(cod==1) update(query(x),query(y));
        else { if(query(x)==query(y)) g<<"DA\n"; else g<<"NU\n";}
    }

    f.close();
    g.close();
    return 0;
}