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

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

struct DSU
{
    vector <int> parent,sizes;
    int N;
    void init(int n)
    {
        N = n;
        for(int i = 1;i <= N;i++)
        {
            parent[i] = i;
            sizes[i] = 1;
        }
    }
    int find(int u)
    {
        if(parent[u] == u)
            return u;
        return parent[u] = find(parent[u]);
    }
    void unite(int u,int v)
    {
        u = find(u);
        v = find(v);
        if(sizes[u] < sizes[v])
            swap(u,v);
        parent[v] = u;
        sizes[u] += sizes[v];
    }
}dsu;

int main()
{
    int n,q,a,b,c;
    fin>>n>>q;
    dsu.init(n);
    for(int i = 1;i <= q;i++)
    {
        fin>>a>>b>>c;
        if(a == 1)
        {
            dsu.unite(b,c);
        }
        else
        {
            if(dsu.find(a) == dsu.find(b))
                fout<<"DA\n";
            else
                fout<<"NU\n";
        }
    }
    return 0;
}