Go: // Warshall–Floyd Algorithm

package main

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

var scanner = bufio.NewScanner(os.Stdin)

const INF = 0x7FFFFFFF

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])
			}
		}
	}
}

Python: max_ = 1001
def solv(p,q):
    global costs
    global times
    global stack
    if times[p][q] < max_:
        #最短経路算出済み
        return costs[p][q],times[p][q]

    if p == q:
        return 0,0

    min_cost = max_
    min_time = max_
    stack.append(p)

    for s in senro :
        if (s[0] == p or s[1] == p) :
            next_ = s[1] if s[0]==p else s[0]
            if next_ in stack: #経過済みは無視
                continue

            c,t = solv(next_,q)
            min_cost = min(c + s[2],min_cost)
            min_time = min(t + s[3],min_time)
    
    costs[p][q] = min_cost
    times[p][q] = min_time

    stack.pop()

    return min_cost,min_time


def froid():
    global costs
    global times
    global m
    for s in senro:
        costs[s[0]][s[1]] = s[2]
        costs[s[1]][s[0]] = s[2]
        times[s[0]][s[1]] = s[3]
        times[s[1]][s[0]] = s[3]

    for k in range(1,m+1):
        for i in range(1,m+1):
            for j in range(1,m+1):
                costs[i][j] = min(costs[i][j],costs[i][k] + costs[k][j])
                times[i][j] = min(times[i][j],times[i][k] + times[k][j])
while True:
    n,m = list(map(int,input().split()))
    if n == 0 and m == 0:
        break

    costs = [[max_ for i in range(m+1)] for j in range(m+1)]
    times = [[max_ for i in range(m+1)] for j in range(m+1)]

    senro = [list(map(int,input().split())) for i in range(n)]
    froid()

    k = int(input())
    for i in range(k):
        p,q,r = list(map(int,input().split()))
        print(times[p][q] if r==1 else costs[p][q])

Python: # coding: utf-8
import queue

class Route:
    def __init__(self, station_number, price, time):
        self.station_number = station_number
        self.price = price
        self.time = time

class Station:
    def __init__(self):
        self.routes = []
    def addRoute(self,route):
        self.routes.append(route)

class Path:
    def __init__(self, now_station, next_station, price, time):
        self.now_station = now_station
        self.next_station = next_station
        self.price = price
        self.time = time

def search_path(stations, come_from, go_to, search_type):
    result = []
    q = queue.Queue()
    for distination in stations[come_from].routes:
        new_path = Path(come_from, distination.station_number, distination.price, distination.time)
        q.put(new_path)
    while not q.empty():
        path = q.get()
        if path.next_station == go_to:
            r = path.price if search_type == 0 else path.time
            result.append(r)
        for distination in stations[path.next_station].routes:
            update_price = path.price + distination.price
            update_time = path.time + distination.time
            next_path = Path(path.next_station, distination.station_number, update_price, update_time)
            q.put(next_path)
    print(sorted(result)[0])

route_count, station_count = map(int, input().split(" "))
stations = [Station() for i in range(station_count)]
for read_line in range(route_count):
    come_from, go_to, price, time = map(int, input().split(" "))
    route = Route(go_to - 1, price, time)
    stations[come_from - 1].addRoute(route)
search_count = int(input())
for read_line in range(search_count):
    come_from, go_to, search_type = map(int, input().split())
    search_path(stations, come_from - 1, go_to - 1, search_type)

Python: # coding: utf-8
class Route:
    def __init__(self, station_number, price, time):
        self.station_number = station_number
        self.price = price
        self.time = time

class Station:
    def __init__(self):
        self.routes = []
    def addRoute(self,route):
        self.routes.append(route)

class Path:
    def __init__(self, now_station, next_station, price, time):
        self.now_station = now_station
        self.next_station = next_station
        self.price = price
        self.time = time

def search_path(stations, come_from, go_to, search_type):
    result = [99999]
    q = []
    for distination in stations[come_from].routes:
        new_path = Path(come_from, distination.station_number, distination.price, distination.time)
        q.append(new_path)
    while len(q) > 0:
        path = q.pop(0)
        if path.next_station == go_to:
            r = path.price if search_type == 0 else path.time
            result.append(r)
        for distination in stations[path.next_station].routes:
            update_price = path.price + distination.price
            update_time = path.time + distination.time
            next_path = Path(path.next_station, distination.station_number, update_price, update_time)
            q.append(next_path)
    print(sorted(result)[0])

route_count, station_count = map(int, input().split(" "))
stations = [Station() for i in range(station_count)]
for read_line in range(route_count):
    come_from, go_to, price, time = map(int, input().split(" "))
    route = Route(go_to - 1, price, time)
    stations[come_from - 1].addRoute(route)
search_count = int(input())
for read_line in range(search_count):
    come_from, go_to, search_type = map(int, input().split())
    search_path(stations, come_from - 1, go_to - 1, search_type)