#include <bits/stdc++.h>
using namespace std;

using db = long double;
const db eps = 1e-16;
int sgn(db x) { return x < -eps ? -1 : x > eps; }
int cmp(db k1,db k2){return sgn(k1-k2);}
namespace LP {
	const int N = 1005, M = 1005;
	int n, m; // n : 变量个数，m : 约束个数
	db a[M + N][N], x[N + M];
	// 约束：对于 1 <= i <= m : a[i][0] + \sum_j x[j] * a[i][j] >= 0
	// x[j] >= 0
	// 最大化 \sum_j x[j] * a[0][j]
	int id[N + M];
	void pivot(int p, int o) {
		std::swap(id[p], id[o + n]);
		db w = -a[o][p];
		for(int i = 0;i <= n;++i) a[o][i] /= w;
		a[o][p] = -1 / w;
		for(int i = 0;i <= m;++i) if(sgn(a[i][p]) && i != o) {
			db w = a[i][p]; a[i][p] = 0;
			for(int j = 0;j <= n;++j) a[i][j] += w * a[o][j];
		}
	}
	db solve() { // nan : 无解，inf : 无界，否则返回最大值
		for(int i = 1;i <= n + m;++i) id[i] = i;
		for(;;) {
			int p = 0, min = 1;
			for(int i = 1;i <= m;++i) {
				if(a[i][0] < a[min][0]) min = i;
			}
			if(a[min][0] >= -eps) break;
			for(int i = 1;i <= n;++i) if(a[min][i] > eps && id[i] > id[p]) {
				p = i;
			}
			if(!p) return nan("");
			pivot(p, min);
		}
		for(;;) {
			int p = 1;
			for(int i = 1;i <= n;++i) if(a[0][i] > a[0][p]) p = i;
			if(a[0][p] < eps) break;
			db min = INFINITY; int o = 0;
			for(int i = 1;i <= m;++i) if(a[i][p] < -eps) {
				db w = -a[i][0] / a[i][p]; int d = sgn(w - min);
				if(d < 0 || !d && id[i] > id[o]) o = i, min = w;
			}
			if(!o) return INFINITY;
			pivot(p, o);
		}
		for(int i = 1;i <= m;++i) x[id[i + n]] = a[i][0];
		return a[0][0];
	}
}

const db INF=1e18;
db g[35][35];
int idcnt=0;
int id[35][35];
db dis[35][35];

int main(){
	ios_base::sync_with_stdio(false);
	cerr << fixed << setprecision(4);
	cout << fixed << setprecision(12);
	
	int n;
	cin >> n;
	for (int i=0;i<n;i++){
		for (int j=0;j<n;j++){
			int x;
			cin >> x;
			if (x!=-1) g[i][j]=x;
			else g[i][j]=INF;
			if (x>0) id[i][j]=++idcnt;
		}
	}
	
	for (int i=0;i<n;i++){
		for (int j=0;j<n;j++){
			dis[i][j]=g[i][j];
		}
	}
	for (int k=0;k<n;k++){
		for (int i=0;i<n;i++){
			for (int j=0;j<n;j++){
				if (k==i || i==j || j==k) continue;
				dis[i][j]=min(dis[i][j],dis[i][k]+dis[k][j]);	
			}
		}
	}
	
//	for (int i=0;i<n;i++){
//		for (int j=0;j<n;j++){
//			cerr << dis[i][j] << " ";
//		}
//		cerr << endl;
//	}
//	for (int i=0;i<n;i++){
//		for (int j=0;j<n;j++){
//			cerr << id[i][j] << " ";
//		}
//		cerr << endl;
//	}
	
	vector<vector<db>> restrict;
	
	for (int i=1;i<=idcnt;i++){
		{
			vector<db> tmp(idcnt+1);
			tmp[0]=-1;
			tmp[i]=1;
			restrict.emplace_back(tmp);
		}
		{
			vector<db> tmp(idcnt+1);
			tmp[0]=2;
			tmp[i]=-1;
			restrict.emplace_back(tmp);
		}
	}
	
	int r;
	cin >> r;
	for (int cc=1;cc<=r;cc++){
		int st,ed;
		db d;
		cin	>> st >> ed >> d;
		vector<int> path;
		for (int now=st;now!=ed;){
			path.emplace_back(now);
			int nxt=0;
			for (int i=0;i<n;i++) if (i!=now && cmp(g[now][i]+dis[i][ed],dis[now][ed])==0) nxt=i;
			now=nxt;
		}
		path.emplace_back(ed);
		
//		for (auto x:path) cerr << x << "->";
//		cerr << endl;
		
		vector<db> tmp(idcnt+1);
		tmp[0]=-d;
		int path_sz=(int)path.size();
		for (int i=1;i<path_sz;i++){
			int u=path[i-1];
			int v=path[i];
			tmp[id[u][v]]=g[u][v];
		}
		restrict.emplace_back(tmp);
		
		for (auto &x:tmp) x=x*(-1);
		restrict.emplace_back(tmp);
	}
	
//	cerr << "--------restrict----------" << endl;
//	for (auto &v:restrict){
//		for (auto x:v) cerr << x << " ";
//		cerr << endl;	
//	}
//	cerr << "------------------" << endl;
	
	int Q;
	cin >> Q;
	for (;Q--;){
		int st,ed;
		cin	>> st >> ed;
		
		vector<int> path;
		for (int now=st;now!=ed;){
		//	cerr << "now : " << now << endl;
			path.emplace_back(now);
			int nxt=0;
			for (int i=0;i<n;i++) if (i!=now && cmp(g[now][i]+dis[i][ed],dis[now][ed])==0) nxt=i;
			now=nxt;
		}
		path.emplace_back(ed);
		
		vector<db> tmp(idcnt+1);
		int path_sz=(int)path.size();
		for (int i=1;i<path_sz;i++){
			int u=path[i-1];
			int v=path[i];
			tmp[id[u][v]]=g[u][v];
		}
		
//		for (auto x:path) cerr << x << "->";
//		cerr << endl;
//		for (auto x:tmp) cerr << x << " ";
//		cerr << endl;
		
		db ans1=0,ans2=0;
		{
			memset(LP::a,0,sizeof(LP::a));
			memset(LP::x,0,sizeof(LP::x));
			memset(LP::id,0,sizeof(LP::id));
			LP::n=idcnt;
			for (auto &vec:restrict){
				++LP::m;
				for (int i=0;i<=idcnt;i++) LP::a[LP::m][i]=vec[i];
			}
			for (int i=0;i<=idcnt;i++) LP::a[0][i]=tmp[i]*(-1);
			ans1=LP::solve()*(-1);
		}
		{
			memset(LP::a,0,sizeof(LP::a));
			memset(LP::x,0,sizeof(LP::x));
			memset(LP::id,0,sizeof(LP::id));
			LP::n=idcnt;
			for (auto &vec:restrict){
				++LP::m;
				for (int i=0;i<=idcnt;i++) LP::a[LP::m][i]=vec[i];
			}
			for (int i=0;i<=idcnt;i++) LP::a[0][i]=tmp[i];
			ans2=LP::solve();
		}
		cout << st << " " << ed << " " << ans1 << " " << ans2 << "\n";
	}
	return 0;	
}