find the weights and sequence on the graph below to reach from A to H , if you are given matrix that reperesents the shortest distances between all vertices when using algorithm??

\begin{tabular}{|l|l|l|} \hline Weighisum & Predecenor & PQ \\ \hline A,0 & A & \\ \hline B,6 & D & \\ \hline C,2 & A & \\ \hline D,4 & C & \\ \hline E,5 & D & \\ \hline F,8 & G & \\ \hline G,6 & E & \\ \hline H,11 & F & \\ \hline \end{tabular} \begin{tabular}{|l|l|l|} \hline Weighisum & Predecenor & PQ \\ \hline A,0 & A & \\ \hline B,6 & D & \\ \hline C,2 & A & \\ \hline D,4 & C & \\ \hline E,5 & D & \\ \hline F,8 & G & \\ \hline G,6 & E & \\ \hline H,11 & F & \\ \hline \end{tabular}