#include <iostream>
#include <iomanip>
#include <vector>
#include <set>
#include <map>
#include <list>
#include <iterator>
#include <queue>
#include <stack>
#include <deque>
#include <sstream>
#include <algorithm>
#include <numeric>
#include <string>
#include <cmath>
#include <complex>
#include <functional>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cassert>
#include <cstdlib>
#include <cctype>

#define REP(i,m,n) for(int i=m;i<(int)n;i++)
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define rp(i,c) rep(i,(int)c.size())
#define fr(i,c) for(__typeof((c).begin()) i=(c).begin();i!=(c).end();i++)
#define mp make_pair
#define pb push_back
#define all(c) (c).begin(),(c).end()
#define rall(u) (u).rbegin(),(u).rend()
#define dbg(x) cerr<<#x<<" = "<<(x)<<endl
#define v_delete(a,b) (a).erase(remove((a).begin(), (a).end(), b), (a).end())
#define v_unique(a) (a).erase(unique((a).begin(), (a).end()), (a).end())
#define VV(T) vector<vector< T > >
#define init(a,b) memset((a), (b), sizeof((a)))
using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pii;
const int inf=1<<28;
const double INF=1e10,EPS=1e-9;


template<class T>int SIZE(T a){return a.size();}
template<class T>string IntToString(T num){string res;stringstream ss;ss<<num;return ss.str();}
template<class T>T StringToInt(string str){T res=0;for(int i=0;i<SIZE(str);i++)res=(res*10+str[i]-'0');return res;}
template<class T>T gcd(T a,T b){if(b==0)return a;return gcd(b,a%b);}
template<class T>T lcm(T a,T b){return a/gcd(a,b)*b;}

template <class T> void input(T& a, int n) { for (int i = 0; i < n; ++i) cin >> a[i]; }
template <class T> void input(T* a, int n) { for (int i = 0; i < n; ++i) cin >> a[i]; }

int in(){
	int t;
	cin >> t;
	return t;
}

struct sta{
	vi edges;
	vi costs;
	vi times;

};

int main()
{

	while(1){
		int n,m,k;
		cin >> n >> m;
		if(n==0 && m==0)
			break;
		vector<sta>stations(m);

		rep(i,n){
			int a,b,cost,time;
			cin >> a >> b >> cost >> time;
			a--;
			b--;
			stations[a].edges.pb(b);
			stations[a].costs.pb(cost);
			stations[a].times.pb(time);
			stations[b].edges.pb(a);
			stations[b].costs.pb(cost);
			stations[b].times.pb(time);
		}
		cin >> k;
		rep(i,k){
			int s,g,q;
			cin >> s >> g >> q;
			s--;
			g--;
			if(!q){
				priority_queue<pii,vector<pii>,greater<pii> > Q;
				vi cost(m,inf);
				cost[s]=0;
				Q.push(mp(0,s));
				while(!Q.empty()){
					pii f=Q.top();Q.pop();
					sta now=stations[f.second];
					if(cost[f.second] < f.first)continue;
					rp(i,now.edges){
						int to=now.edges[i];
						int cos=now.costs[i];
						if(cost[to] > cost[f.second]+cos){
							cost[to]=cost[f.second]+cos;
							Q.push(mp(cost[to],to));
						}
					}
				}
				cout << cost[g] << endl;
			}else{
				priority_queue<pii,vector<pii>,greater<pii> > Q;
				vi time(m,inf);
				time[s]=0;
				Q.push(mp(0,s));
				while(!Q.empty()){
					pii f=Q.top();Q.pop();
					sta now=stations[f.second];
					if(time[f.second] < f.first)continue;
					rp(i,now.edges){
						int to=now.edges[i];
						int ti=now.times[i];
						if(time[to] > time[f.second]+ti){
							time[to]=time[f.second]+ti;
							Q.push(mp(time[to],to));
						}
					}
				}
				cout << time[g] << endl;
			}
		}
	}
}

Measured memory_bytes: 1356