#include <iostream>
#include <fstream>
using namespace std;

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

int T[100002];

int Find(int x)
{
    if(T[x] == x) return x;
    return Find(T[x]);
}

int main()
{
    int n, m;
    f >> n >> m;
    for(int i = 1; i <= n; ++i) T[i] = i;
    for(; m; --m)
    {
        int cod, x, y;
        f >> cod >> x >> y;
        int xx = Find(x), yy = Find(y);
        if(cod == 1)
        {
            T[xx] = T[yy];
            continue;
        }
        if(xx == yy)
            g << "DA\n";
        else g << "NU\n";
    }
}