#include <iostream>
#include <fstream>
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int v[100005],n,m,op,a,b,i;
int rad(int a)
{
    if(v[a]==0)
        return a;
    v[a]=rad(v[a]);
    return v[a];
}
void reun(int a, int b)
{
    int ra,rb;
    ra=rad(a);
    rb=rad(b);
    if(a>b)
        v[ra]=rb;
    else
        v[rb]=ra;
}
int main()
{
    f>>n>>m;
    for(i=0; i<m; i++)
    {
        f>>op>>a>>b;
        if(op==1)
            reun(a,b);
        else if(rad(a)==rad(b))
            g<<"DA"<<"\n";
        else
            g<<"NU"<<"\n";
    }
    f.close();
    g.close();
    return 0;
}