#include <fstream>

using namespace std;
int t[N+1], nr[N+1];

int t[N+1],

int radacina(int x)
{
    if(t[x]==D)
        return x;
    t[x]=radacina(x);
    return t[x];
}
bool verif(int x,int y)
{
    return (radacina(x)+radacina(y));
}
void reuniune(int x, int y)
{
    int rx=radacina(x), ry=radacina(ry);
    if(nr[rx]<nr[ry])
    {
        t[rx]=ry;
        nr[ry]+=nr[rx];
    }
    else
    {
        t[ry]=rx;
        nr[rx]+=nr[ry];
    }
}

int main()
{
    ifstream in("disjoint.in");
    ofstream out("disjoint.out");
    int n, m;
    in >> n >> m;
    for (int i = 1; i <= n; i++)
    {
        nr[i] = 1;
    }
    for (int i = 0; i < m; i++)
    {
        int tip, x, y;
        in >> tip >> x >> y;
        if (tip == 1)
        {
            reuniune(x, y);
        }
        else
        {
            if (verif(x, y))
            {
                out << "DA\n";
            }
            else
            {
                out << "NU\n";
            }
        }
    }
    in.close();
    out.close();
    return 0;
}