Let G be a graph. We say that hypergraph H is Berge-G if there bijection ?:E(G)?E(H) such e??(e) for all e?E(G). For any r-uniform and real number p?1, the p-spectral radius ?(p)(H) of defined as?(p)(H):=maxx?Rn,?x?p=1?r?{i1,i2,…,ir}?E(H)xi1xi2?xir. In this paper, we study hypergraphs. determine 3-uniform hypergraphs with maximum p?1 among when path, cycle or star.