#include<iostream>
#include<queue>
#include<vector>
#include<map>
using namespace std;
typedef pair<int,int> P;
typedef struct{
	int next;
	int cost;
	int time;
}edge;

int n,m;
vector<edge> mapp[101];
int bfs_c(int now,int goal);
int bfs_t(int now,int goal);

int main(){
	while(1){
		cin >> n >> m;
		if(n == 0 && m == 0) break;
		for(int i=0;i<n+1;i++){
			mapp[i].clear();
		}
		for(int i=0;i<n;i++){
			int a,b,cost,time;
			cin >> a >> b >> cost >> time;
			edge x;
			x.next = b; x.cost = cost; x.time = time;
			mapp[a].push_back(x);
		}
		int k;
		cin >> k;
		int ans;
		for(int i=0;i<k;i++){
			int p,q,r;
			cin >> p >> q >> r;
			if(r == 0) ans = bfs_c(p,q);
			else if(r == 1) ans = bfs_t(p,q);
			cout << ans << endl;
		}
	}
}

int bfs_c(int now,int goal){
	priority_queue<P, vector<P>,greater<P> > que;
	que.push(P(now,0));
	while(!que.empty()){
		P p = que.top(); que.pop();
		int no = p.first;
		int co = p.second;
		if(no == goal) return co;
		int len=mapp[no].size();
		for(int i=0;i<len;i++){
			edge x = mapp[no][i];
			que.push(P(x.next,co+x.cost));
		}
	}
	return 0;
}

int bfs_t(int now,int goal){
	priority_queue<P, vector<P>,greater<P> > que;
	que.push(P(now,0));
	while(!que.empty()){
		P p = que.top(); que.pop();
		int no = p.first;
		int co = p.second;
		if(no == goal) return co;
		int len=mapp[no].size();
		for(int i=0;i<len;i++){
			edge x = mapp[no][i];
			que.push(P(x.next,co+x.time));
		}
	}
	return 0;
}