In the previous works of the first author, two completely different constructions of single valued Grassmannian trilogarithms were given. One of the constructions, in Math. Res. Lett. 2 (1995), 99–114, is very simple and provides Grassmannian n-logarithms for all n. However its motivic nature is hidden. The other construction in Adv. in Math. 114 (1995), 197–318, is very explicit and motivic, but the generalization for n>4 is not known. In this paper we will compute explicitly the Grassmannian trilogarithm constructed in Math. Res. Lett. 2 (1995), 99–114 and prove that it differs from the motivic Grassmannian trilogarithm by an explicitly given product of logarithms. We also derive some general results about the Grassmannian polylogarithms.