#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <fstream>
using namespace std;
 
const string file = "disjoint";
 
const string infile = file + ".in";
const string outfile = file + ".out";
 
const int INF = 0x3f3f3f3f;
 
 
vector<int> tata;
vector<int> grad;
int Find(int x)
{
 
    int a = x;
    while(tata[x] != 0)
    {
        x = tata[x];
    }
    while(tata[a] != 0)
    {
        int b = tata[a];
        tata[a] = x;
        a = b;
    }
    return x;
}
 
void Union(int x, int y)
{
    if(grad[x] > grad[y])
        swap(x, y);
 
    grad[y] += grad[x];
    tata[x] = y;
 
}
 
 
 
 
int N, M;
int main()
{
 
    fstream fout(outfile.c_str(), ios::out);
    fstream fin(infile.c_str(), ios::in);
 
    fin >> N >> M;
 
    tata.resize(N + 1);
    grad.resize(N + 1, 1);
    for(int i = 0; i < M; i++)
    {
        int op, x, y;
        fin >> op >> x >> y;
        if(op == 1)
        {
            int a = Find(x);
            int b = Find(y);
            if( a != b)
                Union(a, b);
        }
        else if(op == 2)
        {
            if(Find(x) == Find(y))
                fout << "DA\n";
            else
                fout << "NU\n";
        }
    }
 
 
    fin.close();
    fout.close();
}