#include <fstream>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int n, m, cod, x, y, minim, maxim, C[100010];

int main()
{
    fin >> n >> m;
    for (int i=1; i<=n; i++) C[i] = i;
    for (int i=1; i<=m; i++)
    {
        fin >> cod >> x >> y;
        if (cod == 2)
        {
            if (C[x] == C[y]) fout << "DA\n";
            else              fout << "NU\n";
        }
        else
        {
            if (C[x] < C[y])
            {
                minim = C[x];
                maxim = C[y];
            }
            else
            {
                minim = C[y];
                maxim = C[x];
            }
            for (int j=1; j<=n; j++)
                if (C[j] == maxim) C[j] = minim;
        }
    }

    fout.close();
    return 0;
}