The aim of this paper is to describe an approach to syntaxico-semantic representation in the Lexicalized Tree Adjoining Grammars (LTAG) paradigm \cite{jos:97}. We show that it is possible to use both LTAG's derived and derivation trees, through a shared forest, to build a dependency graph as a basis for further semantic calculation. We illustrate this method with problems raised by control verbs. We assume that the reader is familiar with the LTAG formalism and its operations