Go: // Warshall–Floyd Algorithm

package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
	"strings"
)

var scanner = bufio.NewScanner(os.Stdin)

const INF = 2000000000

func main() {
	for scanner.Scan() {
		buf := strings.Split(scanner.Text(), " ")
		n, _ := strconv.Atoi(buf[0])
		m, _ := strconv.Atoi(buf[1])
		if n == 0 && m == 0 {
			break
		}
		c_matrix := make([][]int, m)
		for i := range c_matrix {
			c_matrix[i] = make([]int, m)
		}
		t_matrix := make([][]int, m)
		for i := range t_matrix {
			t_matrix[i] = make([]int, m)
		}
		for i := 0; i < n; i++ {
			scanner.Scan()
			buf_ := strings.Split(scanner.Text(), " ")
			a, _ := strconv.Atoi(buf_[0])
			b, _ := strconv.Atoi(buf_[1])
			c, _ := strconv.Atoi(buf_[2])
			t, _ := strconv.Atoi(buf_[3])
			c_matrix[a-1][b-1] = c
			t_matrix[a-1][b-1] = t
		}
		c_dist := make([][]int, m)
		c_prev := make([][]int, m)
		t_dist := make([][]int, m)
		t_prev := make([][]int, m)
		for i := 0; i < m; i++ {
			c_dist[i] = make([]int, m)
			c_prev[i] = make([]int, m)
			t_dist[i] = make([]int, m)
			t_prev[i] = make([]int, m)
		}
		for i := 0; i < m; i++ {
			for j := 0; j < m; j++ {
				if c_matrix[i][j] == 0 {
					c_dist[i][j] = INF
					c_prev[i][j] = -1
				} else {
					c_dist[i][j] = c_matrix[i][j]
					c_prev[i][j] = i
				}
				if t_matrix[i][j] == 0 {
					t_dist[i][j] = INF
					t_prev[i][j] = -1
				} else {
					t_dist[i][j] = t_matrix[i][j]
					t_prev[i][j] = i
				}
			}
			c_dist[i][i] = 0
			t_dist[i][i] = 0
		}
		for k := 0; k < m; k++ {
			for i := 0; i < m; i++ {
				for j := 0; j < m; j++ {
					c_newlen := c_dist[i][k] + c_dist[k][j]
					if c_newlen < c_dist[i][j] {
						c_dist[i][j] = c_newlen
						c_prev[i][j] = c_prev[k][j]
					}
				}
			}
		}
		for k := 0; k < m; k++ {
			for i := 0; i < m; i++ {
				for j := 0; j < m; j++ {
					t_newlen := t_dist[i][k] + t_dist[k][j]
					if t_newlen < t_dist[i][j] {
						t_dist[i][j] = t_newlen
						t_prev[i][j] = t_prev[k][j]
					}

				}
			}
		}
		scanner.Scan()
		k, _ := strconv.Atoi(scanner.Text())
		for i := 0; i < k; i++ {
			scanner.Scan()
			buf_ := strings.Split(scanner.Text(), " ")
			p, _ := strconv.Atoi(buf_[0])
			q, _ := strconv.Atoi(buf_[1])
			r, _ := strconv.Atoi(buf_[2])
			switch r {
			case 0:
				fmt.Println(c_dist[p-1][q-1])
			case 1:
				fmt.Println(t_dist[p-1][q-1])
			}
		}
	}
}

C++: #include<iostream>
#include<vector>
#include<algorithm>
#include<utility>
#include<string>
#include<cmath>
#include<cstring>
#include<queue>
#include<map>
#include<climits>
#include<queue>

#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long
#define pb(a) push_back(a)
using namespace std;
typedef pair<int, int> P;
typedef long long int ll;
typedef pair<ll,ll> LLP;
int dx[4] = {1,0,0,-1};
int dy[4] = {0,1,-1,0};
#define INF 1000000007
#define MOD 1000000007
#define ARRAY_MAX 105


void warshal_floyd(vector<vector<int> >& dp){
    REP(k,10){
        REP(i,10){
            REP(j,10){
                dp[i][j] = min(dp[i][j],dp[i][k] + dp[k][j]);
            }
        }
    }
}


int main(){

    int n,m;
    while(cin >> n >> m,n){

        int a,b,c,t;
        vector<vector<int> > mini_cost(ARRAY_MAX,vector<int>(ARRAY_MAX));
        vector<vector<int> > mini_time(ARRAY_MAX,vector<int>(ARRAY_MAX));

        REP(i,ARRAY_MAX){
            REP(j,ARRAY_MAX){
                mini_cost[i][j] = mini_time[i][j] = INF;
                if(i == j){
                    mini_cost[i][j] = mini_time[i][j] = 0;
                }
            }
        }


        REP(i,n){
            cin >> a >> b >> c >> t;
            a--;
            b--;
            mini_cost[a][b] = mini_cost[b][a] = c;
            mini_time[a][b] = mini_time[b][a] = t;
        }

        warshal_floyd(mini_time);
        warshal_floyd(mini_cost);

        int k;
        cin >> k;
        REP(i,k){
            int p,q,r;
            cin >> p >> q >> r;
            p--;
            q--;
            if(r == 0){
                //最小コスト
                cout << mini_cost[p][q] << endl;
            }else{
                cout << mini_time[p][q] << endl;
            }
        }
        mini_cost.shrink_to_fit();
        mini_time.shrink_to_fit();
    }


    return 0;
}

C++: #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <vector>
#include <string>
#include <sstream>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <functional>
 
using namespace std;
 
#define fst first
#define scd second
#define PB push_back
#define MP make_pair
#define chmin(a,b) a=min(a,b)
#define chmax(a,b) a=max(a,b)
#define rep(i,x) for(int i=0;i<(x);++i)
#define rep1(i,x) for(int i=1;i<=(x);++i)
#define rrep(i,x) for(int i=(x)-1;i>=0;--i)
#define rrep1(i,x) for(int i=(x);i>=1;--i)
#define FOR(i,a,x) for(int i=(a);i<(x);++i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
 
template<typename T>T&get(){T a;cin >> a;return a;}
template<typename T>T&rev(T&a){reverse(all(a));return a;}
template<typename T>istream&operator>>(istream&is,vector<T>&vec){rep(i,vec.size())is>>vec[i];return is;}
template<typename T>vector<T>&sort(vector<T>a){sort(all(a));return a;}
 
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
 
const int inf = 1e9;
const ll linf = 3e18;
 
struct edge {
    int to, cost, time;
    edge(int to0,int cost0,int time0) {
        to = to0; cost = cost0; time = time0;
    };
};
 
int N, M;
 
vector<edge> G[100];
int d[100];
 
void dijkstra(int s, int mode)
{
    priority_queue<pii, vector<pii>, greater<pii> > q;
 
    fill(d, d + M, inf);
    d[s] = 0;
 
    q.push(MP(0, s));
 
    while (q.size()) {
        pii p = q.top(); q.pop();
        int v = p.scd;
        rep(u, G[v].size()) {
            edge e = G[v][u];
            int a = mode == 0 ? e.cost : e.time;
            if (d[e.to] > d[v] + a) {
                d[e.to] = d[v] + a;
                q.push(MP(d[e.to], e.to));
            }
        }
    }
}
 
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
 
    while (cin >> N >> M, N || M) {
        rep(i, M) G[i].clear();
 
        rep(i, N) {
            int a, b, cost, time; cin >> a >> b >> cost >> time; a--; b--;
            G[a].PB(edge(b, cost, time));
            G[b].PB(edge(a, cost, time));
        }
 
        int K; cin >> K;
 
        rep(i, K) {
            int p, q, r; cin >> p >> q >> r; p--; q--;
            dijkstra(p, r);
            cout << d[q] << endl;
        }
    }
}