
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cassert>
#include <iostream>
#include <cctype>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <map>
#include <utility>
#include <numeric>
#include <algorithm>
#include <iterator>
#include <bitset>
#include <complex>
#include <fstream>
#include <iomanip>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for(int i = x; i < n; i++)
template<class T> T RoundOff(T a){ return int(a+.5-(a<0)); }
template<class T, class C> void chmax(T& a, C b){ if(a < b) a = b; }
template<class T, class C> void chmin(T& a, C b){ if(b < a) a = b; }
template<class T, class C> pair<T, C> mp(T a, C b){ return make_pair(a, b); }

struct edge
{
	int cost, to;
};

void WarshallFroyd(vector<vint>& d)
{
	int n = d.size();

	rep(k, n) rep(i, n) rep(j, n)
		chmin(d[i][j], d[i][k] + d[k][j]);
}

const int INF = 1 << 28;
int main()
{
	int n, m;
	while(cin >> n >> m && (n || m))
	{
		vector<vint> time(m, vint(m, INF)), cost(m, vint(m, INF));

		rep(i, n)
		{
			int s, t, ti, co;
			cin >> s >> t >> co >> ti; s--, t--;

			cost[s][t] = cost[t][s] = co;
			time[s][t] = time[t][s] = ti;
		}

		WarshallFroyd(time);
		WarshallFroyd(cost);

		int k;
		cin >> k;
		rep(i, k)
		{
			int s, t, f;
			cin >> s >> t >> f; s--, t--;

			cout << (f ?time[s][t] : cost[s][t]) << endl;
		}
	}
}