1 #include <cstdio>
 2 #include <cstring>
 3 using namespace std;
 4 const int INF = 0x3f3f3f;
 5 int map[1010][1010], mpa[1010][1010], dis1[1010], dis2[1010], vis[1010];
 6 int i, j, m, n;
 7 void Dijkstra(int cra)
 8 {
 9     memset(vis, 0, sizeof(vis));
10     for(i=1; i<=m; i++)
11     {
12         dis1[i] = map[cra][i];
13         dis2[i] = mpa[cra][i];
14     }
15     vis[cra] = 1;
16     for(i=1; i<m; i++)
17     {
18         int min = INF, temp = cra;
19         for(j=1; j<=m; j++)
20         {
21             if(!vis[j] && dis1[j] < min)
22             {
23                 temp = j;
24                 min = dis1[j];
25             }
26         }
27         vis[temp] = 1;
28         for(j=1; j<=m; j++)
29         {
30             if(!vis[j] && dis1[j] > dis1[temp] + map[temp][j])
31             {
32                 dis1[j] = dis1[temp] + map[temp][j];
33                 dis2[j] = dis2[temp] + mpa[temp][j];
34             }
35             else if(!vis[j] && dis1[j] == dis1[temp] + map[temp][j] && dis2[j] > dis2[temp]+mpa[temp][j])
36             {
37                 dis2[j] = dis2[temp] + mpa[temp][j]; 
38             }
39         }
40     }
41 }
42 int main()
43 {
44     while(~scanf("%d %d", &m, &n), m|n)
45     {
46         for(i=1; i<=m; i++)
47         for(j=1; j<=m; j++)
48         {
49             map[i][j]=(i==j?0:INF);
50             mpa[i][j]=(i==j?0:INF);
51         }
52         int a, b, d, p;
53         for(i = 1; i <= n; i++)
54         {
55             scanf("%d %d %d %d", &a, &b, &d, &p);
56         /*    if(map[a][b] > d)                     //坑。！ 
57                 map[a][b]=map[b][a]=d;
58             if(mpa[a][b] > p)
59                 mpa[a][b]=mpa[b][a]=p;     */
60             if(map[a][b] > d)
61             {
62                 map[a][b]=map[b][a]=d;
63                 mpa[a][b]=mpa[b][a]=p;
64             }
65         }    
66         int s, t;
67         scanf("%d %d", &s, &t);
68         Dijkstra(s);
69         printf("%d %d\n", dis1[t], dis2[t]);
70     }
71     return 0;
72 }