#include <fstream>
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
int tata[100001], rnk[100001], n, m, i, x, y, t;
int find(int n)
{
    while(tata[n] != n) n = tata[n];
    return tata[n];
}
void Union(int x, int y)
{
    x = find(x);
    y = find(y);
    if(rnk[x] > rnk[y]) tata[y] = x;
    else if(rnk[y] > rnk[x]) tata[x] = y;
    else rnk[y] ++, tata[x] = y;
}
int main()
{
    f >> n >> m;
    for(i = 1; i <= n; ++ i)
        tata[i] = i;
    while(m --)
    {
        f >> t >> x >> y;
        if(t == 1) Union(x, y);
        else if(find(x) == find(y)) g << "DA" << "\n";
                               else g << "NU" << "\n";
    }
    return 0;
}