#include <bits/stdc++.h>
using namespace std;

const long long INF = 1e18;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n, m, s, t;
    if (!(cin >> n >> m >> s >> t)) return 0;
    vector<vector<pair<int, long long>>> adj(n + 1);
    for (int i = 0; i < m; i++) {
        int u, v;
        long long w;
        cin >> u >> v >> w;
        adj[u].push_back({v, w});
    }

    vector<pair<long long, int>> dist(n + 1, {INF, 1e9});
    priority_queue<pair<pair<long long, int>, int>, vector<pair<pair<long long, int>, int>>, greater<>> pq;
    dist[s] = {0, 0};
    pq.push({{0, 0}, s});

    while (!pq.empty()) {
        auto curr = pq.top();
        pq.pop();
        long long d = curr.first.first;
        int edges = curr.first.second;
        int u = curr.second;
        if (d > dist[u].first || (d == dist[u].first && edges > dist[u].second)) continue;
        for (auto& edge : adj[u]) {
            int v = edge.first;
            long long w = edge.second;
            pair<long long, int> next_state = {d + w, edges + 1};
            if (next_state < dist[v]) {
                dist[v] = next_state;
                pq.push({next_state, v});
            }
        }
    }
    if (dist[t].first == INF) {
        cout << "-1 -1\n";
    } else {
        cout << dist[t].first << " " << dist[t].second << "\n";
    }
    return 0;
}