You have a root tree containing n vertexes. Let's number the tree vertexes with integers from 1 to n. The tree root is in the vertex 1.

Each vertex (except fot the tree root) v has a direct ancestor pv. Also each vertex v has its integer value sv. 

Your task is to perform following queries:

  * P v u (u ≠ v). If u isn't in subtree of v, you must perform the assignment pv = u. Otherwise you must perform assignment pu = v. Note that after this query the graph continues to be a tree consisting of n vertexes.
  * V v t. Perform assignment sv = t. 



Your task is following. Before starting performing queries and after each query you have to calculate expected value written on the lowest common ancestor of two equiprobably selected vertices i and j. Here lowest common ancestor of i and j is the deepest vertex that lies on the both of the path from the root to vertex i and the path from the root to vertex j. Please note that the vertices i and j can be the same (in this case their lowest common ancestor coincides with them).

Input

The first line of the input contains integer n (2 ≤ n ≤ 5·104) — the number of the tree vertexes. 

The second line contains n - 1 integer p2, p3, ..., pn (1 ≤ pi ≤ n) — the description of the tree edges. It is guaranteed that those numbers form a tree.

The third line contains n integers — s1, s2, ... sn (0 ≤ si ≤ 106) — the values written on each vertex of the tree.

The next line contains integer q (1 ≤ q ≤ 5·104) — the number of queries. Each of the following q lines contains the description of the query in the format described in the statement. It is guaranteed that query arguments u and v lie between 1 and n. It is guaranteed that argument t in the queries of type V meets limits 0 ≤ t ≤ 106.

Output

Print q + 1 number — the corresponding expected values. Your answer will be considered correct if its absolute or relative error doesn't exceed 10 - 9.

Examples

Input

5
1 2 2 1
1 2 3 4 5
5
P 3 4
P 4 5
V 2 3
P 5 2
P 1 4


Output

1.640000000
1.800000000
2.280000000
2.320000000
2.800000000
1.840000000

Note

Note that in the query P v u if u lies in subtree of v you must perform assignment pu = v. An example of such case is the last query in the sample.
#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline void read(T &x) {
  x = 0;
  char c = getchar();
  bool flag = false;
  while (!isdigit(c)) {
    if (c == '-') flag = true;
    c = getchar();
  }
  while (isdigit(c)) {
    x = (x << 1) + (x << 3) + (c ^ 48);
    c = getchar();
  }
  if (flag) x = -x;
}
int n, m;
int f[100010], fa[100010], ch[100010][2];
long long a[100010], siz[100010], s[100010], s2[100010], ans[100010],
    val[100010], sum[100010];
char opt[3];
bool check(int x) { return ch[fa[x]][1] == x; }
bool notroot(int x) { return ch[fa[x]][0] == x || ch[fa[x]][1] == x; }
void pushup(int x) {
  int ls = ch[x][0], rs = ch[x][1];
  siz[x] = siz[ls] + siz[rs] + s[x], sum[x] = sum[ls] + sum[rs] + a[x] * s[x];
  ans[x] = ans[ls] + ans[rs] + val[x] + a[x] * (s[x] * s[x] - s2[x]) +
           2 * a[x] * siz[rs] * s[x] + 2 * sum[ls] * (siz[x] - siz[ls]);
}
void rotate(int x) {
  int y = fa[x], z = fa[y], k = check(x), w = ch[x][k ^ 1];
  if (notroot(y)) ch[z][check(y)] = x;
  ch[x][k ^ 1] = y, ch[y][k] = w;
  if (w) fa[w] = y;
  fa[x] = z, fa[y] = x;
  pushup(y), pushup(x);
}
void splay(int x) {
  for (int y; notroot(x); rotate(x))
    if (notroot(y = fa[x])) rotate(check(x) ^ check(y) ? x : y);
  pushup(x);
}
long long c(long long x) { return x * x; }
void access(int x) {
  for (int y = 0; x; y = x, x = fa[x]) {
    splay(x);
    s[x] += siz[ch[x][1]] - siz[y];
    s2[x] += c(siz[ch[x][1]]) - c(siz[y]);
    val[x] += ans[ch[x][1]] - ans[y];
    ch[x][1] = y, pushup(x);
  }
}
void link(int x, int y) {
  access(y), splay(y), splay(x);
  s[y] += siz[x], s2[y] += c(siz[x]), val[y] += ans[x], fa[x] = y, pushup(y);
}
void cut(int x, int y) {
  access(y), splay(y), splay(x);
  s[y] -= siz[x], s2[y] -= c(siz[x]), val[y] -= ans[x], fa[x] = 0, pushup(y);
}
double ask() {
  splay(1);
  return (double)ans[1] / ((double)n * n);
}
int main() {
  read(n);
  for (int i = 2; i <= n; ++i) read(f[i]);
  for (int i = 1; i <= n; ++i)
    read(a[i]), ans[i] = sum[i] = a[i], siz[i] = s[i] = 1;
  for (int i = 2; i <= n; ++i) link(i, f[i]);
  printf("%.9lf\n", ask()), read(m);
  while (m--) {
    int x, y;
    scanf("%s", opt), read(x), read(y);
    if (opt[0] == 'P') {
      access(y), splay(y), splay(x);
      if (notroot(y)) swap(x, y);
      cut(x, f[x]), f[x] = y, link(x, f[x]);
    } else
      access(x), splay(x), a[x] = y;
    printf("%.9lf\n", ask());
  }
  return 0;
}
