Problem: Santa has an infinite number of candies for each of m flavours. You are given a rooted tree with n vertices. The root of the tree is the vertex 1. Each vertex contains exactly one candy. The i-th vertex has a candy of flavour f_i.

Sometimes Santa fears that candies of flavour k have melted. He chooses any vertex x randomly and sends the subtree of x to the Bakers for a replacement. In a replacement, all the candies with flavour k are replaced with a new candy of the same flavour. The candies which are not of flavour k are left unchanged. After the replacement, the tree is restored.

The actual cost of replacing one candy of flavour k is c_k (given for each k). The Baker keeps the price fixed in order to make calculation simple. Every time when a subtree comes for a replacement, the Baker charges C, no matter which subtree it is and which flavour it is.

Suppose that for a given flavour k the probability that Santa chooses a vertex for replacement is same for all the vertices. You need to find out the expected value of error in calculating the cost of replacement of flavour k. The error in calculating the cost is defined as follows.

$$$ Error\ E(k) =\ (Actual Cost\ –\ Price\ charged\ by\ the\ Bakers) ^ 2.$$$

Note that the actual cost is the cost of replacement of one candy of the flavour k multiplied by the number of candies in the subtree.

Also, sometimes Santa may wish to replace a candy at vertex x with a candy of some flavour from his pocket.

You need to handle two types of operations: 

  * Change the flavour of the candy at vertex x to w. 
  * Calculate the expected value of error in calculating the cost of replacement for a given flavour k. 

Input

The first line of the input contains four integers n (2 ⩽ n ⩽ 5 ⋅ 10^4), m, q, C (1 ⩽ m, q ⩽ 5 ⋅ 10^4, 0 ⩽ C ⩽ 10^6) — the number of nodes, total number of different flavours of candies, the number of queries and the price charged by the Bakers for replacement, respectively.

The second line contains n integers f_1, f_2, ..., f_n (1 ⩽ f_i ⩽ m), where f_i is the initial flavour of the candy in the i-th node.

The third line contains n - 1 integers p_2, p_3, ..., p_n (1 ⩽ p_i ⩽ n), where p_i is the parent of the i-th node.

The next line contains m integers c_1, c_2, ... c_m (1 ⩽ c_i ⩽ 10^2), where c_i is the cost of replacing one candy of flavour i.

The next q lines describe the queries. Each line starts with an integer t (1 ⩽ t ⩽ 2) — the type of the query.

If t = 1, then the line describes a query of the first type. Two integers x and w follow (1 ⩽ x ⩽ n, 1 ⩽ w ⩽ m), it means that Santa replaces the candy at vertex x with flavour w.

Otherwise, if t = 2, the line describes a query of the second type and an integer k (1 ⩽ k ⩽ m) follows, it means that you should print the expected value of the error in calculating the cost of replacement for a given flavour k.

The vertices are indexed from 1 to n. Vertex 1 is the root.

Output

Output the answer to each query of the second type in a separate line.

Your answer is considered correct if its absolute or relative error does not exceed 10^{-6}.

Formally, let your answer be a, and the jury's answer be b. The checker program considers your answer correct if and only if (|a-b|)/(max(1,b))⩽ 10^{-6}.

Example

Input

3 5 5 7
3 1 4
1 1
73 1 48 85 89
2 1
2 3
1 2 3
2 1
2 3


Output

2920.333333333333
593.000000000000
49.000000000000
3217.000000000000

Note

For 1-st query, the error in calculating the cost of replacement for flavour 1 if vertex 1, 2 or 3 is chosen are 66^2, 66^2 and (-7)^2 respectively. Since the probability of choosing any vertex is same, therefore the expected value of error is (66^2+66^2+(-7)^2)/(3).

Similarly, for 2-nd query the expected value of error is (41^2+(-7)^2+(-7)^2)/(3).

After 3-rd query, the flavour at vertex 2 changes from 1 to 3.

For 4-th query, the expected value of error is ((-7)^2+(-7)^2+(-7)^2)/(3).

Similarly, for 5-th query, the expected value of error is (89^2+41^2+(-7)^2)/(3).

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int nmax = 5e4;
const int logmax = 18;
const int base = 666013;
int n, m, q;
int col[nmax + 1];
long long C, cost[nmax + 1];
vector<int> g[nmax + 1];
bool used[nmax + 1], viz[nmax + 1];
int father[nmax + 1];
int height[nmax + 1], weight[nmax + 1], wmax[nmax + 1];
int nr_nodes;
int nodes_in_comp[nmax + 1];
int last_cen[nmax + 1];
int color_count[nmax + 1];
long long sum_heights[nmax + 1], sum_distances[nmax + 1];
int anc[logmax + 1][nmax + 1];
unordered_map<int, long long> all_dist[nmax + 1], dist_to_last[nmax + 1];
unordered_map<int, int> partial_count[nmax + 1], Distance[nmax + 1];
void read_input() {
  fscanf(stdin, "%d%d%d%I64d", &n, &m, &q, &C);
  for (int i = 1; i <= n; ++i) fscanf(stdin, "%d", &col[i]);
  for (int i = 2; i <= n; ++i) {
    int x;
    fscanf(stdin, "%d", &x);
    g[x].push_back(i);
    g[i].push_back(x);
  }
  for (int i = 1; i <= m; ++i) fscanf(stdin, "%I64d", &cost[i]);
}
void initial_dfs(int node) {
  viz[node] = 1;
  for (auto i : g[node]) {
    if (viz[i] == 0) {
      height[i] = height[node] + 1;
      father[i] = node;
      initial_dfs(i);
    }
  }
}
void dfs(int node) {
  nodes_in_comp[nr_nodes++] = node;
  viz[node] = 1;
  weight[node] = 1;
  wmax[node] = 0;
  for (auto i : g[node]) {
    if (viz[i] == 0 && used[i] == 0) {
      dfs(i);
      weight[node] += weight[i];
      wmax[node] = max(wmax[node], weight[i]);
    }
  }
}
int centroid_decomp(int node) {
  nr_nodes = 0;
  dfs(node);
  int centroid = -1;
  for (int i = 0; i < nr_nodes; ++i) {
    int x = nodes_in_comp[i];
    if (nr_nodes - weight[x] <= nr_nodes / 2 && wmax[x] <= nr_nodes / 2) {
      centroid = x;
    }
    viz[x] = 0;
  }
  used[centroid] = 1;
  for (auto i : g[centroid]) {
    if (used[i] == 0) {
      int next_centroid = centroid_decomp(i);
      last_cen[next_centroid] = centroid;
    }
  }
  return centroid;
}
int find_distance(int x, int y) {
  int ans = height[x] + height[y];
  if (height[x] > height[y]) swap(x, y);
  int dif = height[y] - height[x];
  for (int i = logmax; i >= 0; --i)
    if (dif & (1 << i)) y = anc[i][y];
  for (int i = logmax; i >= 0; --i) {
    if (anc[i][x] != anc[i][y]) {
      x = anc[i][x];
      y = anc[i][y];
    }
  }
  if (x != y) x = anc[0][x];
  return ans - 2 * height[x];
}
void precalculate() {
  height[1] = 1;
  initial_dfs(1);
  memset(viz, 0, sizeof(viz));
  centroid_decomp(1);
  for (int i = 1; i <= n; ++i) anc[0][i] = father[i];
  for (int i = 1; (1 << i) <= n; ++i)
    for (int j = 1; j <= n; ++j) anc[i][j] = anc[i - 1][anc[i - 1][j]];
  for (int i = 1; i <= n; ++i) {
    int ancestor = i;
    while (ancestor != 0) {
      Distance[i][ancestor] = find_distance(i, ancestor);
      ancestor = last_cen[ancestor];
    }
  }
}
void update_color(int x, int color, int type) {
  sum_distances[color] += type * all_dist[color][x];
  int u = x;
  while (last_cen[u] != 0) {
    int CEN = last_cen[u];
    sum_distances[color] +=
        type * Distance[x][CEN] *
        (partial_count[color][CEN] - partial_count[color][u]);
    sum_distances[color] +=
        type * (all_dist[color][CEN] - dist_to_last[color][u]);
    u = CEN;
  }
  u = x;
  while (u != 0) {
    partial_count[color][u] += type;
    all_dist[color][u] += type * Distance[x][u];
    dist_to_last[color][u] += type * Distance[x][last_cen[u]];
    u = last_cen[u];
  }
  sum_heights[color] += type * height[x];
  color_count[color] += type;
}
int main() {
  read_input();
  precalculate();
  for (int i = 1; i <= n; ++i) update_color(i, col[i], 1);
  while (q--) {
    int type;
    fscanf(stdin, "%d", &type);
    if (type == 1) {
      int node, new_color;
      fscanf(stdin, "%d%d", &node, &new_color);
      update_color(node, col[node], -1);
      update_color(node, new_color, 1);
      col[node] = new_color;
    } else {
      int k;
      fscanf(stdin, "%d", &k);
      long long e1 = sum_heights[k];
      long long e2 = sum_heights[k] * color_count[k] - sum_distances[k];
      long long aux = e2 * cost[k] * cost[k] - e1 * 2 * C * cost[k];
      fprintf(stdout, "%.12lf\n", (double)aux / n + C * C);
    }
  }
  return 0;
}