Is a 𝑢−𝑣 path followed by a 𝑣−𝑤 path is a 𝑢−𝑤 path. [closed]

Question

Can I say a 𝑢−𝑣 path followed by a 𝑣−𝑤 path is a 𝑢−𝑤 path.

Because if there is a path from 𝑢−𝑣 followed by 𝑣−𝑤 I believe there should be a 𝑢−𝑤 path.

I don't know how to prove it.

EDIT: A 𝑢−𝑣 path is a path between vertex 𝑢 and 𝑣 vertex. and 𝑣−𝑤 path is a path between vertex 𝑢 and 𝑤 vertex

A walk is a sequence of vertices and edges of a graph i.e. if we traverse a graph, then we get a walk.

A path is a walk with no repeated vertex. This directly implies that no edges will ever be repeated

Answer 1

Imagine that the $vw$ path contains the vertex $u$, the concatenation of $uv$ and $vw$ is not a path, but a walk. To be a path, you have to make sure it does not contains two identical vertices.

Answer 2

Hint: If $f,g:[0,1]\to X$ and $f(1)=g(0)$, then $h:[0,1]\to X$ and $h(0)=f(0)$ and $h(1)=g(1)$, where $$h(t) = \begin{cases} f(2t),& 0\leq t <\tfrac12\\ g(2t-1),& \tfrac12 \leq t \leq 1 \end{cases}$$