#include<fstream>
//#include<iostream>
using namespace std;
ifstream cin("disjoint.in");
ofstream cout("disjoint.out");
int t[100001];
int tatasuprem(int k){
    if(t[k] == k)
        return k;
    else
        return t[k] = tatasuprem(t[k]);
}
void unire(int x, int y){
    int i, j;
    i = tatasuprem(x);
    j = tatasuprem(y);
    t[i] = j;
}
int main(){
    int n, m, i, j, c, x, y;
    cin >> n >> m;
    for(i = 1; i <= n; i++)
        t[i] = i;
    for(i = 1; i <= m; i++){
        cin >> c >> x >> y;
        if(c == 1)
            unire(x, y);
        else{
            if(tatasuprem(x) == tatasuprem(y))
                cout << "DA" << '\n';
            else
                cout << "NU" << '\n';
        }
    }
    return 0;
}