#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; //#define int long long typedef long long ll; typedef unsigned long long ul; typedef unsigned int ui; constexpr ll mod = 998244353; const ll INF = mod * mod; typedef pairP; #define stop char nyaa;cin>>nyaa; #define rep(i,n) for(int i=0;i=0;i--) #define Rep(i,sta,n) for(int i=sta;i=1;i--) #define Rep1(i,sta,n) for(int i=sta;i<=n;i++) #define all(v) (v).begin(),(v).end() typedef pair LP; typedef double ld; typedef pair LDP; const ld eps = 1e-12; const ld pi = acosl(-1.0); ll mod_pow(ll x, ll n, ll m) { ll res = 1; while (n) { if (n & 1)res = res * x % m; x = x * x % m; n >>= 1; } return res; } struct modint { ll n; modint() :n(0) { ; } modint(ll m) :n(m) { if (n >= mod)n %= mod; else if (n < 0)n = (n % mod + mod) % mod; } operator int() { return n; } }; bool operator==(modint a, modint b) { return a.n == b.n; } modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; } modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; } modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; } modint operator+(modint a, modint b) { return a += b; } modint operator-(modint a, modint b) { return a -= b; } modint operator*(modint a, modint b) { return a *= b; } modint operator^(modint a, ll n) { if (n == 0)return modint(1); modint res = (a * a) ^ (n / 2); if (n % 2)res = res * a; return res; } ll inv(ll a, ll p) { return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p); } modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); } const int max_n = 1 << 20; modint fact[max_n], factinv[max_n]; void init_f() { fact[0] = modint(1); for (int i = 0; i < max_n - 1; i++) { fact[i + 1] = fact[i] * modint(i + 1); } factinv[max_n - 1] = modint(1) / fact[max_n - 1]; for (int i = max_n - 2; i >= 0; i--) { factinv[i] = factinv[i + 1] * modint(i + 1); } } modint comb(int a, int b) { if (a < 0 || b < 0 || a < b)return 0; return fact[a] * factinv[b] * factinv[a - b]; } ul gcd(ul a, ul b) { if (a < b)swap(a, b); while (b) { ul r = a % b; a = b; b = r; } return a; } struct lcagraph { private: int n; vector> G; vector> parent; vector depth; int root; int tmp; public: lcagraph(int n_) { n = n_; G.resize(n); parent.resize(n); depth.resize(n); tmp = 0; int cop = n; while (cop) { tmp++; cop /= 2; } rep(i, n)parent[i].resize(tmp); root = 0; } lcagraph() {} void init(int n_) { n = n_; G.resize(n); parent.resize(n); depth.resize(n); tmp = 0; int cop = n; while (cop) { tmp++; cop /= 2; } rep(i, n)parent[i].resize(tmp); root = 0; } void add_edge(int a, int b) { G[a].push_back(b); G[b].push_back(a); } void dfs(int id, int fr, int d) { parent[id][0] = fr; depth[id] = d; rep(j, G[id].size()) { int to = G[id][j]; if (to == fr)continue; dfs(to, id, d + 1); } } void complete(int r = 0) { root = r; dfs(root, -1, 0); rep(j, tmp - 1)rep(i, n) { if (parent[i][j] < 0)parent[i][j + 1] = -1; else parent[i][j + 1] = parent[parent[i][j]][j]; } } int lca(int u, int v) { if (depth[u] > depth[v])swap(u, v); for (int k = 0; k < tmp; k++) { if ((depth[v] - depth[u]) >> k & 1) { v = parent[v][k]; } } if (u == v)return u; for (int k = tmp - 1; k >= 0; k--) { if (parent[u][k] != parent[v][k]) { u = parent[u][k]; v = parent[v][k]; } } return parent[u][0]; } int dep(int x) { return depth[x]; } int dist(int x, int y) { int l = lca(x, y); return depth[x] + depth[y] - 2 * depth[l]; } int find_par(int x, int d) { rep(i, tmp)if (d & (1 << i))x = parent[x][i]; return x; } }; struct edge { int to; }; struct Centroid_Decomposition { private: int n; vector> G; vector> fG; int root; vector par, parid; vector> pardists; vector> dists; vector> nums; vector pdist; vector pnum; lcagraph lg; public: Centroid_Decomposition(int n_) { n = n_; G.resize(n); par.resize(n); parid.resize(n); pardists.resize(n); fG.resize(n); root = -1; dists.resize(n); nums.resize(n); pdist.resize(n); pnum.resize(n); } void add_edge(int a, int b) { G[a].push_back({ b }); G[b].push_back({ a }); } void complete() { vector exi(n, 0); vector ori(n); rep(i, n)ori[i] = i; int tmp = 0; function szdfs = [&](int id, int fr, int& g, int& sz)->int { int res = 1; int ma = 0; for (edge e : G[id]) { if (tmp != exi[e.to])continue; if (e.to == fr)continue; int nex = szdfs(e.to, id, g, sz); ma = max(ma, nex); res += nex; } if (ma <= sz / 2 && sz - res <= sz / 2)g = id; return res; }; function)> cdfs = [&](vector v)->int { tmp++; if (v.empty())return 0; for (int id : v) { exi[id]++; } int g; int sz = v.size(); szdfs(v[0], -1, g, sz); pnum[g] = 0; pardists[g].push_back(0); for (edge e : G[g]) { if (!exi[e.to])continue; if (exi[e.to] != tmp)continue; int tm = dists[g].size(); dists[g].push_back(0); nums[g].push_back(0); queue

vs; vs.push({ e.to,g }); int d = 0; vector nex; while (!vs.empty()) { d++; int len = vs.size(); rep(aa, len) { P p = vs.front(); vs.pop(); int v = p.first, fr = p.second; pardists[v].push_back(d); nex.push_back(v); for (edge e : G[v]) { if (e.to == fr)continue; if (tmp != exi[e.to])continue; vs.push({ e.to,v }); } } } int ng = cdfs(nex); fG[g].push_back(ng); par[ng] = g; parid[ng] = tm; } for (int id : v) { exi[id]++; } tmp--; return g; }; root = cdfs(ori); par[root] = -1; rep(i, n)reverse(all(pardists[i])); //lca lg.init(n); rep(i, n) { for (edge e : G[i]) { if (i < e.to) { lg.add_edge(i, e.to); } } } lg.complete(); } void add(int c, int a) { int g = c; int id; for(int i=0;g>=0;i++){ if (g == c) { pnum[g] += a; } else { //d(g,c) int dist = pardists[c][i]; pnum[g] += a; nums[g][id] += a; pdist[g] += a * dist; dists[g][id] += a * dist; } id = parid[g]; g = par[g]; } } ll query(int c) { int g = c; int id; ll res = 0; for(int i=0;g>=0;i++){ if (g == c) { res += pdist[g]; } else { //d(g,c) ll dist = pardists[c][i]; //cout << res << "\n"; res += pdist[g] - dists[g][id]; //cout << res << "\n"; //cout << pnum[g] << "wow" << nums[g][id] << "\n"; res += (pnum[g] - nums[g][id]) * dist; //cout << "? " << g << " " << c << " " << dist << " " << res << "\n"; } id = parid[g]; g = par[g]; } return res; } }; void solve() { int n, k, q; cin >> n >> k >> q; vector c(k); rep(i, k) { cin >> c[i]; c[i]--; } Centroid_Decomposition cd(n); rep(i, n - 1) { int a, b; cin >> a >> b; a--; b--; cd.add_edge(a, b); } cd.complete(); rep(i, k)cd.add(c[i], 1); rep(i, q) { int t; cin >> t; if (t == 1) { int p, d; cin >> p >> d; p--; d--; cd.add(c[p], -1); c[p] = d; cd.add(c[p], 1); } else { int p; cin >> p; p--; ll ans = cd.query(p); cout << ans << "\n"; } } } signed main() { ios::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(10); init_f(); //expr(); //int t; cin >> t; rep(i, t) //while (cin >> n >> m>>s1>>s2>>t, n) solve(); return 0; }