package main

import (
	"fmt"
)

func main() {
	tc := 0
	fmt.Scanf("%d", &tc)
	for t := 1; t <= tc; t++ {
		// Here accept inputs
		var w, e, c int
		fmt.Scanf("%d %d %d", &w, &e, &c)

		// initial adj matrix
		wpath := [][]int{[]int{}}
		for i:=0;i<w;i++ {
			temp := []int{0}
			for j:=0;j<w;j++ {
				temp = append(temp, 0)
			}
			wpath = append(wpath, temp)
		}
		for i:=0;i<w-1;i++ {
			temp := 0
			fmt.Scanf("%d", &temp)
			wpath[i+1][temp] = 1
			wpath[temp][i+1] = 1
		}
		// fmt.Printf("wpath = %#v\n", wpath)
		epath := [][]int{[]int{}}
		for i:=0;i<e;i++ {
			temp := []int{0}
			for j:=0;j<e;j++ {
				temp = append(temp, 0)
			}
			epath = append(epath, temp)
		}
		for i:=0;i<e-1;i++ {
			temp := 0
			fmt.Scanf("%d", &temp)
			epath[i+1][temp] = 1
			epath[temp][i+1] = 1
		}
		// fmt.Printf("epath = %#v\n", epath)

		for i:=0;i<w;i++{
			vis := make([]bool, w+1)
			for j:=0;j<=w;j++ {
				vis[j]=false
			}
			dfs(i+1, i+1, 0, &wpath, &vis)
		}
		// fmt.Printf("wpath = %#v\n", wpath)
		for i:=0;i<e;i++{
			vis := make([]bool, e+1)
			for j:=0;j<=e;j++ {
				vis[j]=false
			}
			dfs(i+1, i+1, 0, &epath, &vis)
		}
		// fmt.Printf("epath = %#v\n", epath)
		
		// distances among themselves
		wdist, wlen := 0, 0
		for i:=1;i<=w;i++ {
			for j:=i+1;j<=w;j++ {
				wdist += wpath[i][j]
				wlen += 1
			}
		}
		// fmt.Printf("%#v\n", wdist)
		edist, elen := 0, 0
		for i:=1;i<=e;i++ {
			for j:=i+1;j<=e;j++ {
				edist += epath[i][j]
				elen += 1
			}
		}
		// fmt.Printf("%#v\n", edist)
		// Here do something
		ans := []float32{}
		for i:=0;i<c;i++ {
			var n, m int
			fmt.Scanf("%d %d", &n, &m)
			sum, total := 0, 0
			for j:=1;j<=w;j++ {
				for k:=1;k<=e; k++ {
					sum += wpath[n][j] + epath[m][k] + 1
					total++
				}
			}
			// fmt.Printf("dist = %#v\n", dist)
			sum += wdist
			sum += edist
			ans = append(ans, float32(sum) / float32(total + wlen + elen))
		}
		fmt.Printf("Case #%d: ", t)
		for i:=0;i<len(ans);i++ {
			fmt.Printf("%.7f ", ans[i])
		}
		fmt.Printf("\n")
	}
}

func dfs(start int, curr int, dist int, path *[][]int, vis *[]bool) {
	(*vis)[curr] = true
	(*path)[start][curr] = dist
	for i:=1; i<len((*path)[curr]); i++ {
		next := i
		if !(*vis)[next] && (*path)[curr][next] == 1 {
			dfs(start, next, dist + 1, path, vis)
		} 
	}
}