Travelling Salesman (Decision) Problem

Given an input $G=(V,d)$ which is a complete weighted graph, where $d:V\times V\to \mathbb{Q}$ is a distance function, and given a value $D\in \mathbb{Q}$. The output is true if and only if $G$ contains a Hamiltonian cycle $H$ such that the length of $H\le D$.