#include <bits/stdc++.h>
using namespace std;
const int N = 150000 + 10;
const int M = 998244353;
const double eps = 1e-9;
const double PI = acos(-1);
const int oo = 1000000000;
int n, q, L[N], R[N], P[N], T, val[N], fen[N], invN, sz[N], bigC[N];
vector<int> g[N];
pair<int, int> up[N];
int mul(int x, int y) { return 1ll * x * y % M; }
int add(int x, int y) {
  int ret = x + y;
  if (ret > M) ret -= M;
  if (ret < 0) ret += M;
  return ret;
}
void upd(int u, int d) {
  for (; u; u -= u & -u) fen[u] = add(fen[u], d);
}
void upd(int l, int r, int d) {
  upd(r, d);
  upd(l - 1, -d);
}
int get(int u) {
  int ret = 0;
  for (; u <= n; u += u & -u) ret = add(ret, fen[u]);
  return ret;
}
void dfs(int u, int p) {
  P[u] = p;
  L[u] = ++T;
  sz[u] = 1;
  for (int d : g[u]) {
    if (d - p) {
      dfs(d, u);
      sz[u] += sz[d];
    }
  }
  R[u] = T;
}
void dfs(int u, int p, int ls, int cc) {
  int mx = -1, id = -1;
  up[u] = {ls, cc};
  for (int d : g[u]) {
    if (d - p && sz[d] > mx) {
      mx = sz[d];
      id = d;
    }
  }
  bigC[u] = id;
  for (int i = 0; i < g[u].size(); ++i) {
    int d = g[u][i];
    if (d == p) continue;
    if (d - id)
      dfs(d, u, u, i);
    else
      dfs(d, u, ls, cc);
  }
}
int pw(int a, int b) {
  if (!b) return 1;
  int d = pw(a, b / 2);
  d = mul(d, d);
  if (b & 1) d = mul(d, a);
  return d;
}
int main() {
  memset(up, -1, sizeof(up));
  cin >> n >> q;
  invN = pw(n, M - 2);
  for (int a, b, i = 0; i < n - 1; ++i) {
    scanf("%d%d", &a, &b);
    --a;
    --b;
    g[a].push_back(b);
    g[b].push_back(a);
  }
  dfs(0, -1);
  dfs(0, -1, -1, -1);
  for (int t, u, d, i = 0; i < q; ++i) {
    scanf("%d%d", &t, &u);
    --u;
    if (t == 1) {
      scanf("%d", &d);
      val[u] = add(val[u], d);
      int big = bigC[u];
      if (big + 1) upd(L[big], R[big], mul(d, mul(n - sz[big], invN)));
      if (L[u] > 1) upd(1, L[u] - 1, mul(d, mul(sz[u], invN)));
      if (R[u] < n) upd(R[u] + 1, n, mul(d, mul(sz[u], invN)));
    } else {
      int ans = add(val[u], get(L[u]));
      pair<int, int> cur = up[u];
      while (cur.first + 1) {
        int pp = cur.first, ch = g[pp][cur.second];
        ans = add(ans, mul(val[pp], mul(n - sz[ch], invN)));
        cur = up[pp];
      }
      printf("%d\n", ans);
    }
  }
  return 0;
}
