The Cartesian product of wheel graph and path graph is antimagic

Suppose each edge of a simple connected undirected graph is given a unique number from the numbers 1, 2, . . . , q, where q is the number of edges of that graph. Then each vertex is labelled with sum of the labels of the edges incident to it. If no two vertices have the same label, then the graph is called an antimagic graph. We prove that the Cartesian product of wheel graph and path graph is antimagic.