#include <fstream>
#include <vector>
#include <cmath>
using namespace std;

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

void ReuniuneMult(int n, vector<int> &v, int x, int y)
{
    int mini = min(x, y);
    int maxx = max(x, y);
    for (int i = 1; i <= n; ++i)
        if (v[i] == maxx)
            v[i] = mini;
}

int main()
{
    int n, m;
    f >> n >> m;
    vector<int> v;
    v.resize(n + 1);
    for (int i = 1; i <= n; ++i)
        v[i] = i;
    for (int i = 1; i <= m; ++i)
    {
        int x, y, cod;
        f >> cod >> x >> y;
        if (cod == 1)
            ReuniuneMult(n, v, x, y);
        else
        {
            if (v[x] == v[y])
                g << "DA\n";
            else
                g << "NU\n";
        }
    }
    return 0;
}