//
//  main.cpp
//  Disjoint
//
//  Created by Darius Buhai on 24/11/2018.
//  Copyright © 2018 Darius Buhai. All rights reserved.
//

#include <fstream>
using namespace std;

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

int t[100005] = { 0 }, h[100005] = { 0 }, n, m;

int find(int x)
{
    int r;
    for (r = x; t[r] != r; r = t[r]);
    while (t[x] != x)
    {
        int y = t[x];
        t[x] = r;
        x = y;
    }
    return r;
}

int main()
{
    f >> n >> m;
    int x, y, z;
    for (int i = 1; i <= n; i++)
    {
        t[i] = i;
        h[i] = 1;
    }
    for (int i = 0; i < m; i++)
    {
        f >> x >> y >> z;
        if (x == 1)
        {
            int rx = find(y), ry = find(z);
            if (h[rx] > h[ry])
                t[ry] = rx;
            else t[rx] = ry;
            h[ry] += (rx == ry);
        }
        else
            g << (find(y) == find(z) ? "DA\n" : "NU\n");
    }
    return 0;
}