An edge magic total labeling of a (p, q) graph is a bijection f : V(G) ∪ E(G) → 1, 2, … , p + q such that for each edge xy ∈ E(G), the value of f(x) + f(xy) + f(y) is a constant k. If there exists three constants k1, k2 and k3 such that f(x) + f(xy) + f(y) is either k1 or k2 or k3, it is said to be an edge trimagic total labeling. In this paper we prove that the generalized Prism G = Cm Pn′ the generalized web graph WB(Cm′ n) and the generalized web graph without centre WB0 (Cm′ n) are super edge trimagic total graphs