#include <fstream>
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int n,m,a,b,c,p[10005];

int parinte(int nod)
{
    if(p[nod]==nod)
        return nod;
    return p[nod]=parinte(p[nod]);
}

void unire(int x, int y)
{
    p[parinte(x)]=parinte(y);
}

int main()
{
    f>>n>>m;
    for(int i=1;i<=n;i++)
        p[i]=i;
    for(int i=1;i<=m;i++)
    {
        f>>c>>a>>b;
    if(c==1)
        unire(a,b);
    else{
        if(parinte(a)==parinte(b))
            g<<"DA"<<endl;
        else
            g<<"NU"<<endl;
    }
    }
    return 0;
}