#include <fstream>

using namespace std;

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

int T[100005];

int get_root(int x) {
	while (T[x] >= 0)
		x = T[x];
	return x;
}

bool query(int x, int y) {
	return get_root(x) == get_root(y);
}

void join(int x, int y) {
	x = get_root(x);
	y = get_root(y);
	if (T[x] < T[y]) {
		T[x] += T[y];
		T[y] = x;
} else {
	T[y] += T[x];
	T[x] = y;
}
}

int main()
{
    int n, m, x, y, cod;
    in >> n >> m;
    for(int i = 1;i <= n;i ++)
        T[i] = -1;

    for(int i = 0;i < m;i ++)
    {
        in >> cod >> x >> y;
        if(cod == 1)
            join(x, y);
        else{
            if(query(x, y))
                out << "DA" <<"\n";
            else out << "NU" << "\n";
        }
    }
    return 0;
}