#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int parinti[100001];
int sz[100001];
int Find(int x)
{
while(x != parinti[x])
{
x = parinti[x];
}
return x;
}
void Union(int x, int y)
{
x = Find(x);
y = Find(y);
if(sz[x] < sz[y])
{
parinti[x] = y;
sz[y] += sz[x];
}
else
{
parinti[y] = x;
sz[x] += sz[y];
}
}
int main()
{
int n, q;
fin >> n >> q;
for(int i = 1; i <= n; i++)
{
parinti[i] = i;
sz[i] = 1;
}
for(int i = 1; i <= q; i++)
{
int op, x, y;
fin >> op >> x >> y;
if(op == 1)
{
Union(x, y);
}
else
{
if(Find(x) == Find(y))
{
fout << "DA\n";
}
else
{
fout << "NU\n";
}
}
}
return 0;
}