import os,io
input=io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
n=int(input())
class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n

    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)

        if x == y:
            return

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.parents[y] = x

    def size(self, x):
        return -self.parents[self.find(x)]

    def same(self, x, y):
        return self.find(x) == self.find(y)

    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        return len(self.roots())

    def all_group_members(self):
        return {r: self.members(r) for r in self.roots()}

    def __str__(self):
        return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())
uf=UnionFind(n)
a=list(map(int,input().split()))
b=list(map(int,input().split()))
p=list(map(int,input().split()))
q=int(input())
cost=0
flag0=[0]*n
sump=[0]*n
difs=[0]*n
for i in range(n):
  if p[i]:
    sump[i]=1/p[i]
  else:
    flag0[i]=1
for i in range(n):
  cost+=p[i]*(a[i]-b[i])**2
  difs[i]=(a[i]-b[i])
for _ in range(q):
  u,v=map(int,input().split())
  if uf.same(u-1,v-1):
    print(cost)
    continue
  root1=uf.find(u-1)
  root2=uf.find(v-1)
  if not flag0[root1]:
    cost-=difs[root1]**2/sump[root1]
  if not flag0[root2]:
    cost-=difs[root2]**2/sump[root2]
  uf.union(u-1,v-1)
  tmp=sump[root1]+sump[root2]
  sump[root1]=tmp
  sump[root2]=tmp
  tmp=difs[root1]+difs[root2]
  difs[root1]=tmp
  difs[root2]=tmp
  if flag0[root1] or flag0[root2]:
    flag0[root1]=1
    flag0[root2]=1
  if not flag0[root1]:
    cost+=difs[root1]**2/sump[root1]
  print(cost)