#include <fstream>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
const int nmax = 100000;
int n, m;
int t[nmax + 1],rang[nmax + 1];
int Root(int k)
{
    if(t[k] == 0)
        return k;
    else
    {
        int x = Root(t[k]);
        t[k] = x;
        return x;
    }
}
void Connect(int p, int k)
{
    int rp = Root(p), rk = Root(k);
    if(rp != rk)
    {
        if(rang[rp] > rang[rk])
        {
            t[rk] = rp;
        }
        else
        {
            t[rp] = rk;
            if(rang[rp] == rang[rk])
                rang[rp]++;
        }
    }
}
int main()
{
    fin >> n >> m;
    for(int i = 1; i <= m; i++)
    {
        int cod, x, y;
        fin >> cod >> x >> y;
        if(cod == 1)
        {
            Connect(x, y);
        }
        else if(cod == 2)
        {
            if(Root(x) != Root(y))
                fout << "NU\n";
            else fout << "DA\n";
        }
    }
    return 0;
}