#include<cstdio>
#include<iostream>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<queue>
typedef long long ll;
using namespace std;
const int oo=21474836;
int n,m,k,cnt,x,y,z,dis[100005],vis[100005];
struct node{int to;int val;int next;int cos;
}e[100005];
int head[100004];
int coo[100004],hh;
void add(int a,int b,int c,int d){cnt++;e[cnt].to=b;e[cnt].val=c;e[cnt].cos=d;e[cnt].next=head[a];head[a]=cnt;
}
int main(){freopen("216.in","r",stdin);freopen("216.out","w",stdout);while(1){scanf("%d %d",&n,&m);queue<int>q; cnt=0;if(n==0 && m==0) break; for(int i=1;i<=m;i++){scanf("%d %d %d %d",&hh,&x,&y,&z);add(hh,x,y,z);add(x,hh,y,z);}memset(head,0,sizeof(head));memset(e,0,sizeof(e));memset(dis,0x3f,sizeof(dis));memset(coo,0x3f,sizeof(coo));memset(vis,0,sizeof(vis));int s,t;scanf("%d %d",&s,&t);q.push(s);dis[s]=0;coo[s]=0;vis[s]=1;while(!q.empty()){x=q.front();q.pop();vis[x]=0;for(int i=head[x];i!=0;i=e[i].next){int too=e[i].to;if(dis[too]>dis[x]+e[i].val){ dis[too]=dis[x]+e[i].val;coo[too]=coo[x]+e[i].cos; if(vis[too]==0) { vis[too]=1; q.push(too); }} if(dis[too]==dis[x]+e[i].val && coo[x]+e[i].cos<coo[too]){ dis[too]=dis[x]+e[i].val;coo[too]=coo[x]+e[i].cos; if(vis[too]==0) { vis[too]=1; q.push(too); }} }}printf("%d %d\n",dis[t],coo[t]);}return 0;
}

#include<iostream>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<queue>
typedef long long ll;
using namespace std;
const int oo=21474836;
int n,m,k,cnt,x,y,z,dis[1000005];//,vis[100005];
struct node{int to;int val;int next;int cos;
}e[1000005];
int head[1000005];
int coo[1000005],hh;
struct Node{int pos,dis,cos;bool operator < ( const Node &a )const{return a.dis==dis?a.cos<cos:a.dis<dis;}
};
priority_queue<Node>q;
void add(int a,int b,int c,int d){cnt++;e[cnt].to=b;e[cnt].val=c;e[cnt].cos=d;e[cnt].next=head[a];head[a]=cnt;
}
int main(){freopen("216.in","r",stdin);freopen("216.out","w",stdout);while(1){scanf("%d%d",&n,&m);cnt=0;if(n==0 && m==0) break; memset(head,0,sizeof(head));memset(e,0,sizeof(e));memset(dis,0x3f,sizeof(dis));memset(coo,0x3f,sizeof(coo));for(int i=1;i<=m;i++){scanf("%d%d%d%d",&x,&hh,&y,&z);add(hh,x,y,z);add(x,hh,y,z);}int s,t;scanf("%d%d",&s,&t);q.push((Node){s,0,0});dis[s]=0;coo[s]=0;while(!q.empty()){Node tmp=q.top();q.pop();int x=tmp.pos;for(int i=head[x];i!=0;i=e[i].next){int too=e[i].to;if(dis[too]>dis[x]+e[i].val){ dis[too]=dis[x]+e[i].val;coo[too]=coo[x]+e[i].cos;q.push((Node){too,dis[too],coo[too]});} else if(dis[too]==dis[x]+e[i].val && coo[x]+e[i].cos<coo[too]){ dis[too]=dis[x]+e[i].val;coo[too]=coo[x]+e[i].cos;q.push((Node){too,dis[too],coo[too]});} }}printf("%d %d\n",dis[t],coo[t]);}return 0;
}