#include <cstdio>

#include <map>

#include <iostream>

#include<cstring>

#include<bits/stdc++.h>

#define ll long long int

#define M 6

using namespace std;

inline ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}

inline ll lcm(ll a,ll b){return a/gcd(a,b)*b;}

int moth[]={,,,,,,,,,,,,};

int dir[][]={, ,, ,-, ,,-};

int dirs[][]={, ,, ,-, ,,-, -,- ,-, ,,- ,,};

const int inf=0x3f3f3f3f;

const ll mod=1e9+;

struct node{

    int next;

    int to;

    int d,p;

};

node edge[];

int head[];

int cnt;

void add(int u,int v,int d,int p){

    edge[++cnt].next=head[u];

    edge[cnt].to=v;

    edge[cnt].d=d;

    edge[cnt].p=p;

    head[u]=cnt;

}

int n,m;

int s,e;

bool vis[];

int dis[],cost[];

void spfa(int x){

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

        dis[i]=inf;

        cost[i]=inf;

    }

    dis[x]=cost[x]=;

    memset(vis,,sizeof(vis));

    queue<int > q;

    q.push(x);

    vis[x]=;

    while(!q.empty()){

        int u=q.front();

        q.pop();

        vis[u]=;

        for(int i=head[u];i!=;i=edge[i].next){

            int to=edge[i].to; int d=edge[i].d; int p=edge[i].p;

            if(dis[to]>dis[u]+d||((dis[to]==dis[u]+d)&&(cost[to]>cost[u]+p))){

                cost[to]=cost[u]+p;

                dis[to]=dis[u]+d;

                if(!vis[to]){

                    q.push(to);

                    vis[to]=;

                }

            }

        }

    }

}

int main(){

    //ios::sync_with_stdio(false);

    while(scanf("%d%d",&n,&m)!=EOF){

        if(!n&&!m) break;

        memset(head,,sizeof(head));

        cnt=;

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

            int a,b,d,p;

            scanf("%d%d%d%d",&a,&b,&d,&p);

            add(a,b,d,p);

            add(b,a,d,p);

        }

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

        spfa(s);

        printf("%d %d\n",dis[e],cost[e]);

    }

}