#include <fstream>
#include <vector>
using namespace std;

ifstream fin("disjoint.in");
ofstream fout("disjoint.out");

int n, m;
int tata_de[100005], lant_maxim[100005];

int findRoot(int x)
{
    if (x == tata_de[x])
        return x;
    return findRoot(tata_de[x]);
}

void join(int a, int b)
{
    int tata_a = findRoot(a);
    int tata_b = findRoot(b);
    if (tata_a == tata_b)
        return;
    if (lant_maxim[tata_a] < lant_maxim[tata_b])
        tata_de[tata_a] = tata_b;
    else if (lant_maxim[tata_a] > lant_maxim[tata_b])
        tata_de[tata_b] = tata_a;
    else if (lant_maxim[tata_a] == lant_maxim[tata_b])
    {
        tata_de[tata_b] = tata_a;
        lant_maxim[tata_a]++;
    }
}

void lookup(int a, int b)
{
    if (findRoot(a) == findRoot(b))
        fout << "DA\n";
    else
        fout << "NU\n";
}

int main()
{
    fin >> n >> m;
    for (int i = 1; i <= n; i++)
    {
        tata_de[i] = i;
        lant_maxim[i] = 1;
    }
    for (int i = 0; i < m; i++)
    {
        int cod, a, b;
        fin >> cod >> a >> b;
        if (cod == 1)
            join(a, b);
        else
            lookup(a, b);
    }
    return 0;
}