An automorphism σ of a finite simple graph Γ is a shift, if for every vertex v ∈ V(Γ), σv is adjacent to v in Γ. The graph Γ is shift-transitive, if for every pair of vertices u, v ∈ V(Γ) there exists a sequence of shifts σ1, σ2, ..., σk ∈ Aut(Γ) such that σ1σ2...σku = v. If, in addition, for every pair of adjacent vertices u, v ∈ V(Γ) there exists exactly one shift σ ∈ Aut(Γ) sending u to v, then Γ is uniquely shift-transitive. The purpose of this paper is to prove that, if Γ is a uniquely shift-transitive graph of valency 5 and SΓ is the set of shifts of Γ then 〈SΓ〉, the subgroup generated by SΓ is an Abelian regular subgroup of Aut(Γ)