#include <iostream>

 #include <queue>

 #include <cstdio>

 #include <algorithm>

 #include <cmath>

 #include <cstring>

 #include <queue>

 #include <vector>

 #define INF 0x3f3f3f3f

 #define FRE() freopen("in.txt","r",stdin)

 using namespace std;

 typedef long long ll;

 typedef pair<int,int> P;//first是距离,second是点的编号

 const int maxn = ;

 struct Edge{

     int to,c,d;

     Edge(int t,int cost,int dis):to(t),c(cost),d(dis){}

 };

 vector<Edge> G[maxn];

 priority_queue<P, vector<P>, greater<P> > que;

 int dist[maxn],cost[maxn];

 int n,m,st,en;

 void init(){

     int s,e,d,c;

     scanf("%d%d%d%d",&n,&m,&st,&en);

     for(int i = ; i<m; i++){

         scanf("%d%d%d%d",&s,&e,&d,&c);

         G[s].push_back(Edge(e,c,d));

         G[e].push_back(Edge(s,c,d));

     }

     for(int i = ; i<n; i++){

         dist[i] = INF;

         cost[i] = INF;

     }

 }

 int main(){

     //FRE();

     init();

     dist[st] = ;

     cost[st] = ;

     que.push(P(,st));//指的是当前点的最短距离

     while(que.size()){

         P p = que.top();

         que.pop();

         int v = p.second;//当前的点

         if(p.first > dist[v])continue;

         //cout<<"v: "<<v;

         for(int i = ; i<G[v].size(); i++){

             Edge e = G[v][i];//当最短距离相等的时候而花费更小的时候，更新最短距离的花费

             if((dist[e.to] > dist[v]+e.d)||(dist[e.to] == dist[v]+e.d && cost[e.to] > cost[v]+e.c)){

                 dist[e.to] = dist[v]+e.d;

                 cost[e.to] = cost[v]+e.c;

                 //cout<<" cost: "<<cost[e.to];

                 que.push(P(dist[e.to], e.to));

             }

             //cout<<" "<<dist[e.to];

         }

         //cout<<endl;

     }

     printf("%d %d\n",dist[en],cost[en]);

     return ;

 }

 /*

 样例输入:

 4 5 0 3

 0 1 1 20

 1 3 2 30

 0 3 4 10

 0 2 2 20

 2 3 1 20

 样例输出:

 3 40

 */