#include "bits/stdc++.h"
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
 
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
 
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
 
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template<class T> using pq = priority_queue<T>;
template<class T> using pqg = priority_queue<T, vector<T>, greater<T>>;
 
#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define trav(a,x) for (auto& a : x)
#define uid(a, b) uniform_int_distribution<int>(a, b)(rng)
 
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define ins insert

template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef DEBUG
#define dbg(x...) cerr << "\e[91m"<<__func__<<":"<<__LINE__<<" [" << #x << "] = ["; _print(x); cerr << "\e[39m" << endl;
#else
#define dbg(x...)
#endif


const int MOD = 1000000007;
const char nl = '\n';
const int MX = 100001; 

typedef long double T;
typedef vector<vd> vvd;
const T eps = 1e-9, inf = 1/.0;
#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)) {
            F0R(i, m) F0R(j, n) D[i][j] = A[i][j];
            F0R(i, m) {
                B[i] = n+i, D[i][n] = -1, D[i][n+1] = b[i];
            }
            F0R(j, 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];
        F0R(i, m+2) if (i != r && abs(D[i][s]) > eps) {
            T *b = D[i].data(), binv = b[s]*inv;
            F0R(j, n+2) b[j] -= a[j]*binv;
            b[s] = a[s]*binv;
        }
        F0R(j, n+2) if (j != s) D[r][j] *= inv;
        F0R(i, 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;
        while(true) {
            int s = -1; F0R(j, n+1) if (N[j] != -phase) ltj(D[x]);
            if (D[x][s] >= -eps) return true;
            int r = -1;
            F0R(i, 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() {
        int r = 0; FOR(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;
            F0R(i, m) if (B[i] == -1) {
                int s = 0; FOR(j, 1, n+1) ltj(D[i]);
                pivot(i, s);
            }
        }
        bool ok = simplex(1);
        return ok ? D[m][n+1] : inf;
    }
};

vector<vector<pair<int, pi>>> graph(31);
int N;

vi getPath(int r, int s) {
    int dist[N];
    F0R(i, N) dist[i] = 1e9;
    dist[r] = 0;
    pqg<pi> q; q.push({0, r});
    pi lst[N];
    while (!q.empty()) {
        auto [d, v] = q.top(); q.pop();
        if (d != dist[v]) continue;
        trav(a, graph[v]) {
            if (ckmin(dist[a.f], d + a.s.f)) {
                q.push({dist[a.f], a.f});
                lst[a.f] = {v, a.s.s};
            }
        }
    }
    int cur = s;
    vi res;
    while (cur != r) {
        res.pb(lst[cur].s); cur = lst[cur].f;
    }
    return res;
}

void solve() {
    cin >> N;
    int nr = 0;
    vd dist;
    F0R(i, N) {
        F0R(j, N) {
            int X; cin >> X;
            if (i != j && X != -1) {
                graph[i].pb({j, {X, nr}});
                dist.pb(X);
                nr++;
            }
        }
    }

    vvd A;
    vd B;
    F0R(i, nr) {
        vd cur(nr);
        cur[i] = 1;
        A.pb(cur);
        B.pb(dist[i]*2);
        cur[i] = -1;
        A.pb(cur);
        B.pb(-dist[i]);
    }
    int R; cin >> R;
    F0R(i, R) {
        int X, Y; ld T; cin >> X >> Y >> T;
        vi pth = getPath(X, Y);
        vd cur(nr);
        trav(a, pth) cur[a] = 1;
        A.pb(cur);
        B.pb(T+eps);
        trav(a, pth) cur[a] = -1;
        A.pb(cur);
        B.pb(-T+eps);
    }

    /*dbg(A);
    dbg(B);*/

    cout << setprecision(20);
    int Q; cin >> Q;
    while(Q--) {
        int X, Y; cin >> X >> Y;
        cout << X << " " << Y << " ";
        vi pth = getPath(X, Y);
        vd cur(nr);
        trav(a, pth) cur[a] = -1;
        LPSolver lp1(A, B, cur);
        cout << -lp1.solve() << " ";
        trav(a, pth) cur[a] = 1;
        LPSolver lp2(A, B, cur);
        cout << lp2.solve() << nl;
    }

}
 
int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);

    int T = 1;
//    cin >> T;
    while(T--) {
        solve();
    }

	return 0;
}