you give tree n node as reminder tree connect undirected graph cyclesLet a_1 a_2 ldot a_n sequence integer perform follow operation exactly n time Select unerase node u Assign a_u number unerase node adjacent u then erase node u edge endpoint for integer k 1 n find number modulo 998244353 different sequence a_1 a_2 ldots a_n satisfy follow condition possible obtain perform aforementioned operation exactly n time order operatornamegcda_1 a_2 ldot a_n k here operatornamegcd mean great common divisor element