#include <fstream>
#define nmax 100001

using namespace std;

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

int n, m, t[100001], cod, x, y;

int rad(int x)
{
    if(t[x]>0)
        return rad(t[x]);
    return x;
}

void join(int x, int y)
{
    x = rad(x), y = rad(y);
    if(x == y)
        return;
    if(t[x] > t[y])
        swap(x, y);

    t[x] += t[y];
    t[y] = x;
}
int main()
{
    fin >> n >> m;

    for(int i = 1; i <= n; i++)
        t[i] = -1;

    while(m--)
    {
        fin >> cod >> x >> y;
        if(cod == 1)
            join(x, y);
        else if(rad(x) == rad(y))
            fout << "DA\n";
        else
            fout << "NU\n";
    }
    return 0;
}