#include <bits/stdc++.h>
#define INF 0x3f3f3f3f
using namespace std;
int n,m,s,d;
long long int dist[100000];
long long int vis[100000];
long long int dis[100000],cnt;
typedef struct{
int u,v,w,value,next;
}Node;
int head[100000];
Node edge[100000];
void SPFA(){
queue<int>q;
q.push(s);
vis[s] = 1;
while(!q.empty()){
int u = q.front();
q.pop();
vis[u] = 0;
for(int i = head[u]; i > 0; i = edge[i].next){
int v = edge[i].v;
int w = edge[i].w;
int value = edge[i].value;
if(dist[v] > dist[u] + w){
dist[v] = dist[u] + w;
dis[v] = dis[u] + value;
if(!vis[v]){
vis[v] = 1;
q.push(v);
}
}
else if(dist[v] == dist[u] + w && dist[v] != dist[1000]){
if(dis[v] > dis[u] + value)
dis[v] = dis[u] + value;
}
}
}
}
int main(){
int T;
scanf("%d",&T);
while(T--){
memset(dist,INF,sizeof(dist));
memset(dis,0,sizeof(dis));
memset(vis,0,sizeof(vis));
memset(head,0,sizeof(head));
cnt = 0;
scanf("%d%d%d%d",&n,&m,&s,&d);
for(int i = 1; i <= m; i++){
int u,v,w,value;
scanf("%d%d%d%d",&u,&v,&w,&value);
cnt++;
edge[cnt].u = u;
edge[cnt].v = v;
edge[cnt].w = w;
edge[cnt].value = value;
edge[cnt].next = head[u];
head[u] = cnt;
cnt++;
edge[cnt].u = v;
edge[cnt].v = u;
edge[cnt].w = w;
edge[cnt].value = value;
edge[cnt].next = head[v];
head[v] = cnt;
}
dist[s] = 0;
SPFA();
printf("%lld %lld\n",dist[d],dis[d]);
}
return 0;
}