#include <cstdio>

using namespace std;
const int nmax=100005;
int t[nmax],h[nmax];

int main()
{
	freopen("disjoint.in","r",stdin);
	freopen("disjoint.out","w",stdout);
    int i,n,m,u,v,a;
    scanf("%d%d",&n,&m);
    for(i=1;i<=n;i++)
		{
		t[i]=i;
		h[i]=1;
		}
    for(i=1;i<=m;i++)
	{
		scanf("%d%d%d",&a,&u,&v);
		if(a==1)
		{
			if(t[u]!=t[v])
			{
				if(h[t[u]]==h[t[v]])
				{
					t[v]=t[u];
					h[t[u]]++;
				}
				else if(h[t[u]]>h[t[v]])
					t[v]=t[u];
				else
					t[u]=t[v];
			}
		}
		else
		{
			if(t[u]==t[v])
				printf("DA\n");
			else
				printf("NU\n");
		}
	}
}