#include <iostream>
#include <limits.h>
#include <cmath>
#include <string>
#include <stdio.h>
#include <algorithm>
#include <stdlib.h>
#include <vector>
#include <stack>
#include <map>
#include <fstream>
#include <list>
#include <queue>
#include <iomanip>
#include <deque>
#include <set>
using namespace std;

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

#define mm 100001
int n,m;
int sursa[mm];
int tata[mm];
vector<int> v[mm];

void Unesc(int x, int y)
{
    int princ, sec;

    if (tata[x] == -1)
        {
            princ = x;
            tata[x] = x;
        }
    else
        princ = tata[x];

    if (tata[y] == -1)
            sec = y;
    else
        sec = tata[y];

    v[princ].push_back(sec);
    sursa[princ] ++;
    sursa[sec] = 0;
    tata[sec] = princ;

    for(int i = 0; i < v[sec].size(); i++)
        tata[v[sec][i]] = princ;
}

int Verific(int x, int y)
{
    if (tata[x] != -1 and tata[y] != -1)
        if (tata[x] == tata[y])
            return 1;

    return 0;
}

int main()
{
    f >> n >> m;

    for(int i = 1; i<=n; i++)
        {
            sursa[i] = 0;
            tata[i] = -1;
        }

    for(int i = 1; i<=m; i++)
    {
        int x,y,z;
        f >> x >> y >> z;

        if (x == 1)
        {
            if (sursa[tata[y]] >= sursa[tata[z]])
                Unesc(y,z);
            else
                Unesc(z,y);
        }
        else
        {
            if(Verific(y,z) == 1)
                g << "DA" <<'\n';
            else
                g << "NU" <<'\n';

        }
    }

    return 0;
}