#include<bits/stdc++.h>

#define f first
#define s second
#define pb push_back
#define rep(i,a,b) for(int i=a;i<(b);++i)
#define sz(x) (int)(x).size()

using namespace std;
typedef double T; // long double , Rational , double + mod<P>...
typedef vector<T> vd;
typedef vector<vd> vvd;
typedef vector<int> vi;
const T eps = 1e-8, inf = 1/.0;
#define MP make_pair
#define ltj(X) if(s == -1 || MP(X[j],N[j]) < MP(X[s],N[s])) s=j
struct LPSolver {
    int m, n;
    vi N, B;
    vvd D;
    LPSolver(const vvd& A, const vd& b, const vd& c) : m(sz(b)), n(sz(c)), N(n+1), B(m), D(m+2, vd(n+2)) {
        rep(i,0,m) rep(j,0,n) D[i][j] = A[i][j];
        rep(i,0,m) { B[i] = n+i; D[i][n] = -1; D[i][n+1] = b[i];}
        rep(j,0,n) { N[j] = j; D[m][j] = -c[j]; }
        N[n] = -1; D[m+1][n] = 1;
    }
    void pivot(int r, int s) {
        T *a = D[r].data(), inv = 1 / a[s];
        rep(i,0,m+2) if (i != r && abs(D[i][s]) > eps) {
            T *b = D[i].data(), inv2 = b[s] * inv;
            rep(j,0,n+2) b[j] -= a[j] * inv2;
            b[s] = a[s] * inv2;
        }
        rep(j,0,n+2) if (j != s) D[r][j] *= inv;
        rep(i,0,m+2) if (i != r) D[i][s] *= -inv;
        D[r][s] = inv;
        swap(B[r], N[s]);
    }
    bool simplex(int phase) {
        int x = m + phase - 1;
        for (;;) {
            int s = -1;
            rep(j,0,n+1) if (N[j] != -phase) ltj(D[x]);
            if (D[x][s] >= -eps) return true;
            int r = -1;
            rep(i,0,m) {
            if (D[i][s] <= eps) continue;
            if (r == -1 || MP(D[i][n+1] / D[i][s], B[i])
            < MP(D[r][n+1] / D[r][s], B[r])) r = i;
            }
            if (r == -1) return false;
            pivot(r, s);
        }
    }
    T solve(vd &x) {
        int r = 0;
        rep(i,1,m) if (D[i][n+1] < D[r][n+1]) r = i;
        if (D[r][n+1] < -eps) {
        pivot(r, n);
        if (!simplex(2) || D[m+1][n+1] < -eps) return -inf;
        rep(i,0,m) if (B[i] == -1) {
        int s = 0;
        rep(j,1,n+1) ltj(D[i]);
        pivot(i, s);
        }
        }
        bool ok = simplex(1); x = vd(n);
        rep(i,0,m) if (B[i] < n) x[B[i]] = D[i][n+1];
        return ok ? D[m][n+1] : inf;
    }
};
const int N=31;
int dist[N][N],roadInd[N][N],n;
vector<pair<int,int>> roads;
vector<int> roadInds(int s,int t){
    vector<int> d(n,INT_MAX);
    vector<int> par(n);
    d[s]=0;
    par[s]=s;
    priority_queue<pair<int,int>> q;
    q.push({d[s],s});
    while(sz(q)){
        auto tr=q.top();
        q.pop();
        if(tr.f!=d[tr.s])continue;
        for(int i=0;i<n;i++){
            if(roadInd[tr.s][i]!=-1){
                int nd=d[tr.s]+dist[tr.s][i];
                if(nd<d[i]){
                    d[i]=nd;
                    par[i]=roadInd[tr.s][i];
                    q.push({d[i],i});
                }
            }
        }
    }
    assert(d[t]!=INT_MAX);
    vector<int> ans;
    while(t!=s){
        ans.pb(par[t]);
        t=roads[par[t]].f;
    }
    return ans;
}
int main(){
    scanf("%i",&n);
    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            scanf("%i",&dist[i][j]);
            if(dist[i][j]>0){
                roads.pb({i,j});
                roadInd[i][j]=sz(roads)-1;
            }
            else{
                roadInd[i][j]=-1;
            }
        }
    }
    vvd A;
    vd B;
    int m=sz(roads);
    for(int i=0;i<m;i++){
        vd t;
        for(int j=0;j<m;j++){
            if(i!=j)t.pb(0);
            else t.pb(1);
        }
        A.pb(t);
        B.pb(dist[roads[i].f][roads[i].s]);
    }
    int r;
    scanf("%i",&r);
    for(int i=0;i<r;i++){
        int s,t,d;
        scanf("%i %i %i",&s,&t,&d);
        vector<int> rd=roadInds(s,t);
        for(auto p:rd){
            d-=dist[roads[p].f][roads[p].s];
        }
        assert(d>=0);
        vd tpos,tneg;
        for(int j=0;j<m;j++){
            bool in=0;
            for(auto p:rd)if(p==j)in=1;
            if(in)tpos.pb(1),tneg.pb(-1);
            else tpos.pb(0),tneg.pb(0);
        }
        A.pb(tpos);
        B.pb(d);
        A.pb(tneg);
        B.pb(-d);
    }
    int q;
    scanf("%i",&q);
    for(int i=0;i<q;i++){
        int s,t;
        scanf("%i %i",&s,&t);
        vd cmn,cmx,xmn,xmx;
        vector<int> rd=roadInds(s,t);
        int d=0;
        for(auto p:rd){
            d+=dist[roads[p].f][roads[p].s];
        }
        for(int j=0;j<m;j++){
            bool in=0;
            for(auto p:rd)if(p==j)in=1;
            if(in)cmx.pb(1),cmn.pb(-1);
            else cmx.pb(0),cmn.pb(0);
        }
        T ansMn = LPSolver(A,B,cmn).solve(xmn);
        T ansMx = LPSolver(A,B,cmx).solve(xmx);
        printf("%i %i %.10lf %.10lf\n",s,t,d-ansMn,d+ansMx);
    }
}