using System; using System.Collections.Generic; using System.IO; using System.Linq; using static System.Math; using System.Text; using System.Threading; using System.Globalization; using System.Runtime.CompilerServices; using System.Runtime.InteropServices; using Library; namespace Program { public static class ProblemD { static bool SAIKI = false; static public int numberOfRandomCases = 0; static public void MakeTestCase(List _input, List _output, ref Func _outputChecker) { } static public void Solve() { var N = NN; var Q = NN; var AB = Repeat(0, N - 1).Select(_ => new { A = NN - 1, B = NN - 1 }).ToArray(); var path = Repeat(0, N).Select(_ => new List()).ToArray(); foreach (var item in AB) { path[item.A].Add(item.B); path[item.B].Add(item.A); } var left = new long[N]; var vtxToIdx = new long[N]; var nextVtx = 0L; Action dfs = null; dfs = (node, parent) => { left[node] = nextVtx; foreach (var item in path[node]) { if (item == parent) continue; dfs(item, node); } vtxToIdx[node] = nextVtx; ++nextVtx; }; dfs(0, -1); var XList = NNList(N); var seg = new LIB_DualSegTree<(LIB_Mod998244353 a, LIB_Mod998244353 b)>(XList.Select(e => ((LIB_Mod998244353)e, (LIB_Mod998244353)0)), (1, 0), (x, y) => (x.a * y.a, x.b * y.a + y.b)); for (var i = 0; i < Q; ++i) { var t = NN; if (t == 1) { var V = NN - 1; Console.WriteLine(seg[vtxToIdx[V]].a + seg[vtxToIdx[V]].b); } else if (t == 2) { var V = NN - 1; var K = NN; var C = NN; var D = NN; seg[vtxToIdx[V]] = (seg[vtxToIdx[V]].a * C, seg[vtxToIdx[V]].b * C + D); foreach (var item in path[V]) { seg[vtxToIdx[item]] = (seg[vtxToIdx[item]].a * C, seg[vtxToIdx[item]].b * C + D); } } else { var V = NN - 1; var C = NN; var D = NN; seg.Update(left[V], vtxToIdx[V] + 1, (C, D)); } } } class Printer : StreamWriter { public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } } public Printer(Stream stream) : base(stream, new UTF8Encoding(false, true)) { base.AutoFlush = false; } public Printer(Stream stream, Encoding encoding) : base(stream, encoding) { base.AutoFlush = false; } } static LIB_FastIO fastio = new LIB_FastIODebug(); static string[] args; static public void Main(string[] args_t) { args = args_t; if (args_t.Length == 0) { fastio = new LIB_FastIO(); Console.SetOut(new Printer(Console.OpenStandardOutput())); } if (SAIKI) { var t = new Thread(Solve, 134217728); t.Start(); t.Join(); } else Solve(); Console.Out.Flush(); } static long NN => fastio.Long(); static double ND => fastio.Double(); static string NS => fastio.Scan(); static long[] NNList(long N) => Repeat(0, N).Select(_ => NN).ToArray(); static double[] NDList(long N) => Repeat(0, N).Select(_ => ND).ToArray(); static string[] NSList(long N) => Repeat(0, N).Select(_ => NS).ToArray(); static long Count(this IEnumerable x, Func pred) => Enumerable.Count(x, pred); static IEnumerable Repeat(T v, long n) => Enumerable.Repeat(v, (int)n); static IEnumerable Range(long s, long c) => Enumerable.Range((int)s, (int)c); static IOrderedEnumerable OrderByRand(this IEnumerable x) => Enumerable.OrderBy(x, _ => xorshift); static IOrderedEnumerable OrderBy(this IEnumerable x) => Enumerable.OrderBy(x.OrderByRand(), e => e); static IOrderedEnumerable OrderBy(this IEnumerable x, Func selector) => Enumerable.OrderBy(x.OrderByRand(), selector); static IOrderedEnumerable OrderByDescending(this IEnumerable x) => Enumerable.OrderByDescending(x.OrderByRand(), e => e); static IOrderedEnumerable OrderByDescending(this IEnumerable x, Func selector) => Enumerable.OrderByDescending(x.OrderByRand(), selector); static IOrderedEnumerable OrderBy(this IEnumerable x) => x.OrderByRand().OrderBy(e => e, StringComparer.OrdinalIgnoreCase); static IOrderedEnumerable OrderBy(this IEnumerable x, Func selector) => x.OrderByRand().OrderBy(selector, StringComparer.OrdinalIgnoreCase); static IOrderedEnumerable OrderByDescending(this IEnumerable x) => x.OrderByRand().OrderByDescending(e => e, StringComparer.OrdinalIgnoreCase); static IOrderedEnumerable OrderByDescending(this IEnumerable x, Func selector) => x.OrderByRand().OrderByDescending(selector, StringComparer.OrdinalIgnoreCase); static string Join(this IEnumerable x, string separator = "") => string.Join(separator, x); static uint xorshift { get { _xsi.MoveNext(); return _xsi.Current; } } static IEnumerator _xsi = _xsc(); static IEnumerator _xsc() { uint x = 123456789, y = 362436069, z = 521288629, w = (uint)(DateTime.Now.Ticks & 0xffffffff); while (true) { var t = x ^ (x << 11); x = y; y = z; z = w; w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)); yield return w; } } static bool Chmax(this ref T lhs, T rhs) where T : struct, IComparable { if (lhs.CompareTo(rhs) < 0) { lhs = rhs; return true; } return false; } static bool Chmin(this ref T lhs, T rhs) where T : struct, IComparable { if (lhs.CompareTo(rhs) > 0) { lhs = rhs; return true; } return false; } static void Fill(this T[] array, T value) => array.AsSpan().Fill(value); static void Fill(this T[,] array, T value) => MemoryMarshal.CreateSpan(ref array[0, 0], array.Length).Fill(value); static void Fill(this T[,,] array, T value) => MemoryMarshal.CreateSpan(ref array[0, 0, 0], array.Length).Fill(value); static void Fill(this T[,,,] array, T value) => MemoryMarshal.CreateSpan(ref array[0, 0, 0, 0], array.Length).Fill(value); } } namespace Library { partial struct LIB_Mod998244353 : IEquatable, IEquatable { const int _mod = 998244353; long v; [MethodImpl(MethodImplOptions.AggressiveInlining)] public LIB_Mod998244353(long x) { if (x < _mod && x >= 0) v = x; else if ((v = x % _mod) < 0) v += _mod; } [MethodImpl(MethodImplOptions.AggressiveInlining)] static public implicit operator LIB_Mod998244353(long x) => new LIB_Mod998244353(x); [MethodImpl(MethodImplOptions.AggressiveInlining)] static public implicit operator long(LIB_Mod998244353 x) => x.v; [MethodImpl(MethodImplOptions.AggressiveInlining)] public void Add(LIB_Mod998244353 x) { if ((v += x.v) >= _mod) v -= _mod; } [MethodImpl(MethodImplOptions.AggressiveInlining)] public void Sub(LIB_Mod998244353 x) { if ((v -= x.v) < 0) v += _mod; } [MethodImpl(MethodImplOptions.AggressiveInlining)] public void Mul(LIB_Mod998244353 x) => v = (v * x.v) % _mod; [MethodImpl(MethodImplOptions.AggressiveInlining)] public void Div(LIB_Mod998244353 x) => v = (v * Inverse(x.v)) % _mod; [MethodImpl(MethodImplOptions.AggressiveInlining)] static public LIB_Mod998244353 operator +(LIB_Mod998244353 x, LIB_Mod998244353 y) { var t = x.v + y.v; return t >= _mod ? new LIB_Mod998244353 { v = t - _mod } : new LIB_Mod998244353 { v = t }; } [MethodImpl(MethodImplOptions.AggressiveInlining)] static public LIB_Mod998244353 operator -(LIB_Mod998244353 x, LIB_Mod998244353 y) { var t = x.v - y.v; return t < 0 ? new LIB_Mod998244353 { v = t + _mod } : new LIB_Mod998244353 { v = t }; } [MethodImpl(MethodImplOptions.AggressiveInlining)] static public LIB_Mod998244353 operator *(LIB_Mod998244353 x, LIB_Mod998244353 y) => x.v * y.v; [MethodImpl(MethodImplOptions.AggressiveInlining)] static public LIB_Mod998244353 operator /(LIB_Mod998244353 x, LIB_Mod998244353 y) => x.v * Inverse(y.v); [MethodImpl(MethodImplOptions.AggressiveInlining)] static public bool operator ==(LIB_Mod998244353 x, LIB_Mod998244353 y) => x.v == y.v; [MethodImpl(MethodImplOptions.AggressiveInlining)] static public bool operator !=(LIB_Mod998244353 x, LIB_Mod998244353 y) => x.v != y.v; [MethodImpl(MethodImplOptions.AggressiveInlining)] static public long Inverse(long x) { long b = _mod, r = 1, u = 0, t = 0; while (b > 0) { var q = x / b; t = u; u = r - q * u; r = t; t = b; b = x - q * b; x = t; } return r < 0 ? r + _mod : r; } [MethodImpl(MethodImplOptions.AggressiveInlining)] public bool Equals(LIB_Mod998244353 x) => v == x.v; [MethodImpl(MethodImplOptions.AggressiveInlining)] public bool Equals(long x) => v == x; [MethodImpl(MethodImplOptions.AggressiveInlining)] public override bool Equals(object x) => x == null ? false : Equals((LIB_Mod998244353)x); [MethodImpl(MethodImplOptions.AggressiveInlining)] public override int GetHashCode() => v.GetHashCode(); [MethodImpl(MethodImplOptions.AggressiveInlining)] public override string ToString() => v.ToString(); static List _fact = new List() { 1, 1 }; static List _inv = new List() { 0, 1 }; static List _factinv = new List() { 1, 1 }; static long _factm = _mod; [MethodImpl(MethodImplOptions.AggressiveInlining)] static void B(long n) { if (_factm != _mod) { _fact = new List() { 1, 1 }; _inv = new List() { 0, 1 }; _factinv = new List() { 1, 1 }; } if (n >= _fact.Count) { for (int i = _fact.Count; i <= n; ++i) { _fact.Add(_fact[i - 1] * i); _inv.Add(_mod - _inv[(int)(_mod % i)] * (_mod / i)); _factinv.Add(_factinv[i - 1] * _inv[i]); } } _factm = _mod; } [MethodImpl(MethodImplOptions.AggressiveInlining)] static public LIB_Mod998244353 Comb(long n, long k) { B(n); if (n == 0 && k == 0) return 1; if (n < k || n < 0) return 0; return _fact[(int)n] * _factinv[(int)(n - k)] * _factinv[(int)k]; } [MethodImpl(MethodImplOptions.AggressiveInlining)] static public LIB_Mod998244353 CombOK(long n, long k) { LIB_Mod998244353 ret = 1; LIB_Mod998244353 deno = 1; var chk = n - k; if (chk < k) k = chk; for (var i = 0; i < k; i++) ret *= n - i; for (var i = 1; i <= k; i++) deno *= i; return ret / deno; } [MethodImpl(MethodImplOptions.AggressiveInlining)] static public LIB_Mod998244353 Perm(long n, long k) { B(n); if (n == 0 && k == 0) return 1; if (n < k || n < 0) return 0; return _fact[(int)n] * _factinv[(int)(n - k)]; } [MethodImpl(MethodImplOptions.AggressiveInlining)] static public LIB_Mod998244353 KanzenPerm(long n, long k) => Enumerable.Range(0, (int)k + 1).Aggregate((LIB_Mod998244353)0, (a, e) => a + (1 - ((e & 1) << 1)) * LIB_Mod998244353.Comb(k, e) * LIB_Mod998244353.Perm(n - e, k - e)); [MethodImpl(MethodImplOptions.AggressiveInlining)] static public LIB_Mod998244353 Pow(LIB_Mod998244353 x, long y) { LIB_Mod998244353 a = 1; while (y != 0) { if ((y & 1) == 1) a.Mul(x); x.Mul(x); y >>= 1; } return a; } } class LIB_DualSegTree where T : IEquatable { int n, height; T ti; Func f; T[] dat; [MethodImpl(MethodImplOptions.AggressiveInlining)] public LIB_DualSegTree(long _n, T _ti, Func _f) { n = 1; height = 0; while (n < _n) { n <<= 1; ++height; } ti = _ti; f = _f; dat = Enumerable.Repeat(ti, n << 1).ToArray(); } [MethodImpl(MethodImplOptions.AggressiveInlining)] public LIB_DualSegTree(IEnumerable l, T _ti, Func _f) : this(l.Count(), _ti, _f) { var idx = 0; foreach (var item in l) dat[n + idx++] = item; } [MethodImpl(MethodImplOptions.AggressiveInlining)] void Eval(long i) { if (dat[i].Equals(ti)) return; dat[(i << 1) | 0] = f(dat[(i << 1) | 0], dat[i]); dat[(i << 1) | 1] = f(dat[(i << 1) | 1], dat[i]); dat[i] = ti; } [MethodImpl(MethodImplOptions.AggressiveInlining)] void Thrust(long i) { for (var j = height; j > 0; j--) Eval(i >> j); } [MethodImpl(MethodImplOptions.AggressiveInlining)] void Thrust(long l, long r) { if (l == r) { Thrust(l); return; } var xor = l ^ r; var i = height; for (; (xor >> i) != 0; --i) Eval(l >> i); for (; i != 0; --i) { Eval(l >> i); Eval(r >> i); } } [MethodImpl(MethodImplOptions.AggressiveInlining)] public void Update(long l, long r, T v) { if (l == r) return; if (r < l) throw new Exception(); Thrust(l += n, r += n - 1); for (long li = l, ri = r + 1; li < ri; li >>= 1, ri >>= 1) { if ((li & 1) == 1) { dat[li] = f(dat[li], v); ++li; } if ((ri & 1) == 1) { --ri; dat[ri] = f(dat[ri], v); } } } public class LazySegTreeOperator { T rangeOperator; public T value => rangeOperator; [MethodImpl(MethodImplOptions.AggressiveInlining)] static public LazySegTreeOperator operator *(LazySegTreeOperator lhs, T rhs) { lhs.rangeOperator = rhs; return lhs; } } public LazySegTreeOperator this[long l, long r] { [MethodImpl(MethodImplOptions.AggressiveInlining)] get => new LazySegTreeOperator(); [MethodImpl(MethodImplOptions.AggressiveInlining)] set => Update(l, r + 1, value.value); } public T this[long idx] { [MethodImpl(MethodImplOptions.AggressiveInlining)] get { Thrust(idx += n); return dat[idx]; } [MethodImpl(MethodImplOptions.AggressiveInlining)] set { Thrust(idx += n); dat[idx] = value; } } } class LIB_FastIO { [MethodImpl(MethodImplOptions.AggressiveInlining)] public LIB_FastIO() { str = Console.OpenStandardInput(); } readonly Stream str; readonly byte[] buf = new byte[2048]; int len, ptr; [MethodImpl(MethodImplOptions.AggressiveInlining)] byte read() { if (ptr >= len) { ptr = 0; if ((len = str.Read(buf, 0, 2048)) <= 0) { return 0; } } return buf[ptr++]; } [MethodImpl(MethodImplOptions.AggressiveInlining)] char Char() { byte b = 0; do b = read(); while (b < 33 || 126 < b); return (char)b; } [MethodImpl(MethodImplOptions.AggressiveInlining)] virtual public string Scan() { var sb = new StringBuilder(); for (var b = Char(); b >= 33 && b <= 126; b = (char)read()) sb.Append(b); return sb.ToString(); } [MethodImpl(MethodImplOptions.AggressiveInlining)] virtual public long Long() { long ret = 0; byte b = 0; var ng = false; do b = read(); while (b != '-' && (b < '0' || '9' < b)); if (b == '-') { ng = true; b = read(); } for (; true; b = read()) { if (b < '0' || '9' < b) return ng ? -ret : ret; else ret = (ret << 3) + (ret << 1) + b - '0'; } } [MethodImpl(MethodImplOptions.AggressiveInlining)] virtual public double Double() { return double.Parse(Scan(), CultureInfo.InvariantCulture); } } class LIB_FastIODebug : LIB_FastIO { Queue param = new Queue(); [MethodImpl(MethodImplOptions.AggressiveInlining)] string NextString() { if (param.Count == 0) foreach (var item in Console.ReadLine().Split(' ')) param.Enqueue(item); return param.Dequeue(); } [MethodImpl(MethodImplOptions.AggressiveInlining)] public LIB_FastIODebug() { } [MethodImpl(MethodImplOptions.AggressiveInlining)] public override string Scan() => NextString(); [MethodImpl(MethodImplOptions.AggressiveInlining)] public override long Long() => long.Parse(NextString()); [MethodImpl(MethodImplOptions.AggressiveInlining)] public override double Double() => double.Parse(NextString()); } }