For a connected locally (G, s)-arc-transitive graph Γ with s 2 and an edge {v, w}, determining the amalgam (G v , G w , G vw ) is a fundamental problem in the area of symmetrical graph theory, but it is very difficult. In this paper, we give a classification of (G v , G w , G vw ) in the case where the vertex stabilisers G v and G w are faithful on their neighbourhoods, which shows that except for the case G v ∼ = G w , there are exactly 16 such triples.