#include <bits/stdc++.h>

using namespace std;

ifstream fin("disjoint.in");
ofstream fout("disjoint.out");

vector<int> tati(100010), rang(100010);

int n, m, x, y, op;

int find_root(int x)
{
    while (tati[x] != x)
        x = tati[x];
    return x;
}

void unite(int x, int y)
{
    int rad_x = find_root(x);
    int rad_y = find_root(y);

    if (rang[x] >= rang[y])
    {
        tati[rad_y] = rad_x;
        rang[rad_x] += rang[rad_y];
    }
    else
    {
        tati[rad_x] = rad_y;
        rang[rad_y] += rang[rad_x];
    }
}

void display()
{
    for (int i = 1; i <= 5; i++)
        cout << tati[i] << " ";
    cout << endl;

    for (int i = 1; i <= 5; i++)
        cout << rang[i] << " ";

    cout << endl
         << endl;
}

int main()
{

    fin >> n >> m;

    for (int i = 1; i <= n; i++)
    {
        rang[i] = 1;
        tati[i] = i;
    }

    for (int i = 1; i <= m; i++)
    {
        fin >> op >> x >> y;
        if (op == 1)
            unite(x, y);
        else
            if (find_root(x) == find_root(y))
                fout<<"DA\n";
            else 
                fout<<"NU\n";
    }

    /*
    cin>>n;
            for(int i=1;i<=n;i++)
    {
        rang[i]=1;
        tati[i]=i;
    }
    for(int i=1;i<=n;i++)
    {
        cin>>x>>y;
        unite(x,y);
        display();
    }
    */
    return 0;
}