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

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

const int N = 100001;
const int M = 100001;
int n, nr[N], m, a, x, y, t[N];

int radacina( int x){
    if(t[x] == 0){
        return 1;
    }
    t[x] = radacina(t[x]);
    return t[x];
}

bool interog( int x, int y){
    return(radacina(x) == radacina(y));
}

void reuniune(int x, int y){
    int rx = radacina(x);
    int ry = radacina(y);
    if(nr[rx] < nr[ry]){
        nr[ry] += nr[rx];
        t[rx] = ry;
    }else{
        nr[rx] += nr[ry];
        t[ry] = rx;
    }
}

int main()
{
    in >> n >> m;
    for(int i = 1; i <= m; i++){
        in >> a >> x >> y;
        if(a == 1)
            reuniune(x,y);
        else{
            if(interog(x,y))
                out << "DA"<<'\n';
            else
                out << "NU"<<'\n';
        }

    }

    return 0;
}