#include <iostream>
#include <fstream>
#include <algorithm>
#include <utility>
#include <deque>
#include <queue>
#include <vector>
#include <limits.h>
#include <map>
using namespace std;

const int LIM = 1005;
int n, m, x;
vector <int> graf[LIM];
queue <int> coada;

bool bfs(int varf){
    bool in[LIM] = {0};

    coada.push(varf);
    in[varf] = true;

    while(coada.empty() == false){
        int nod = coada.front();
        coada.pop();
        //cout << nod << "\n";
        for(size_t i = 0; i < graf[nod].size(); ++i){
            if(in[graf[nod][i]] == false){
                in[graf[nod][i]] = true;

                if(graf[nod][i] == x)
                    return true;

                coada.push(graf[nod][i]);
            }
        }
    }

    return false;
}

int main() {
    ifstream fin("disjoint.in");
    ofstream fout("disjoint.out");
    fin >> n >> m;

    for(int i = 1; i <= m; ++i){
        int cod, a, b;
        fin >> cod >> a >> b;

        if(cod == 1){
            graf[a].push_back(b);
            graf[b].push_back(a);
        }
        else{
            x = b;
            if(bfs(a) == true)
                fout << "DA" << "\n";
            else
                fout << "NU" << "\n";
        }

    }

    return 0;
}