1003

#include<iostream>
#include<queue>
#define N 500+10
#define INF 0x0fffffff
using namespace std;

void DFS(int p,int len,int sum);
void init();

int Count, Maxnum, Maxl;
int n, m, c1, c2;
int num[N];
int visit[N];
int map[N][N];

int main()
{
    cin >> n >> m >> c1 >> c2;
    init();
    for (int i = 0; i < n; i++)
        cin >> num[i];
    for (int i = 1; i <= m; i++)
    {
        int a, b, l;
        cin >> a >> b >> l;
        map[a][b] = map[b][a] = l;
    }
    DFS(c1,0,num[c1]);
    cout << Count << ' ' << Maxnum << endl;
    system("pause");
    return 0;
}
void init()
{
    Maxnum = Count = 0;
    Maxl = INF;
    for (int i = 0; i < n; i++)
    {
        visit[i] = 0;
        for (int j = 0; j < n; j++)
            map[i][j] = i == j ? 0 : INF;
    }
}
void DFS(int p,int len,int sum)
{
    if (p == c2)
    {
        if (len < Maxl)
        {
            Maxl = len;
            Count = 1;
            Maxnum = sum;

        }
        else if (len == Maxl)
        {
            Count++;
            if (Maxnum < sum)
                Maxnum = sum;
        }
        return;
    }
    visit[p] = 1;
    for (int i = 0; i < n; i++)
    {
        if (map[p][i] < INF&&visit[i] == 0)
        {
            DFS(i,len+map[p][i],sum+num[i]);    
        }
    }
    visit[p] = 0;
}