#include <fstream>
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
const int N=100001;
struct cod {
    int t, x, y;
};
cod q[N];
int t[N];
int n, m;
int radacina (int x) {
    if (t[x] == 0)
        return x;

    t[x] = radacina (t[x]);

    return t[x];
}
int main() {
    f>>n>>m;
    int i;
    for(i=1; i<=m; i++)
        f>>q[i].t>>q[i].x>>q[i].y;
    for (i = 1; i <= m; i ++)
        if (q[i].t == 1)
            t[radacina(q[i].x)] = q[i].y;
        else if (radacina (q[i].x) == radacina (q[i].y))
            g<<"DA"<<"\n";
        else
            g<<"NU"<<"\n";

    return 0;
}