#include <bits/stdc++.h>
using namespace std;
ifstream f("disjoint.in");
ofstream g("disjoint.out");
vector<int> v, sz;
int n, t;
int find(int);
int main()
{
    f >> n >> t;
    v.resize(n + 1);
    sz.resize(n + 1);
    for (int i = 1; i <= n; i++)
        v[i] = i, sz[i] = 1;
    for (int c, x, y; t; t--)
    {
        f >> c >> x >> y;
        x = find(x);
        y = find(y);
        if (c == 2)
            g << (x == y ? "DA\n" : "NU\n");
        else
        {
            if (sz[x] < sz[y])
                swap(x, y);
            sz[x] += sz[y];
            v[y] = v[x];
        }
    }
    return 0;
}
int find(int x)
{
    if (x == v[x])
        return x;
    return v[x] = find(v[x]);
}