#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <stack>
#include <array>
#include <list>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
struct unionfind{
    vector<int> as, bs;
    vector<double> ps;
    vector<int> par, sz;
    unionfind() {}
    unionfind(int n):par(n), sz(n, 1), as(n), bs(n), ps(n){
        for(int i=0; i<n; i++) par[i]=i;
    }
    int find(int x){
        if(par[x]==x) return x;
        return par[x]=find(par[x]);
    }
    bool unite(int x, int y){
        x=find(x); y=find(y);
        if(x==y) return false;
        if(sz[x]>sz[y]) swap(x, y);
        par[x]=y;
        as[y]+=as[x];
        bs[y]+=bs[x];
        if(ps[y]<0 || ps[x]<0) ps[y]=-1;
        else ps[y]+=ps[x];
        sz[y]+=sz[x];
        return true;
    }
    bool same(int x, int y){
        return find(x)==find(y);
    }
    int size(int x){
        return sz[find(x)];
    }
    double calc(int x){
        x=find(x);
        if(ps[x]<0) return 0;
        return (double)(as[x]-bs[x])*(as[x]-bs[x])/ps[x];
    }
};
int main()
{
    int n;
    cin>>n;
    int a[100010], b[100010], p[100010];
    for(int i=0; i<n; i++) cin>>a[i];
    for(int i=0; i<n; i++) cin>>b[i];
    for(int i=0; i<n; i++) cin>>p[i];
    int q; cin>>q;
    unionfind uf(n);
    for(int i=0; i<n; i++){
        uf.as[i]=a[i];
        uf.bs[i]=b[i];
        uf.ps[i]=-1;
        if(p[i]>0) uf.ps[i]=1.0/p[i];
    }
    double ans=0;
    for(int i=0; i<n; i++){
        ans+=(double)p[i]*(a[i]-b[i])*(a[i]-b[i]);
    }
    while(q--){
        int x, y; cin>>x>>y; x--; y--;
        double ans1=ans;
        ans1-=uf.calc(x);
        ans1-=uf.calc(y);
        if(uf.unite(x, y)){
            ans1+=uf.calc(x);
            ans=ans1;
        }
        printf("%.9lf\n", ans);
    }
    return 0;
}