codevs1001

#include <iostream>
#include <algorithm>

using namespace std;
struct node{
    int b,e;
    double w;
}p[5505];

int fn[505];
int fz = 1<<30,fm = 1;
bool cmp(node x,node y)
{

    return x.w>y.w;
}

int find(int x)
{
    return x ==fn[x]?x:fn[x] = find(fn[x]);
}

int main()
{
    int n,m;
    int s,t;
    cin>>n>>m;
    for(int i = 0;i<m;i++)
    {

        cin>>p[i].b>>p[i].e>>p[i].w;
    }
    sort(p,p+m,cmp);
    cin>>s>>t;
    bool flag = 0;
    for(int i = 0;i<m;i++)
    {
        if(p[i].b==s&&p[i].e==t)
        {
            cout<<"1";
            return 0;
        }
        for(int j = 0;j<n;j++)
        {
            fn[j] = j;
        }
        for(int k = i;k<m;k++)
        {
            int x = find(p[k].b);
            int y = find(p[k].e);
            if(x!=y) fn[x] = y;
            if(find(s)==find(t))
            {
                if(p[i].w/p[k].w<(double)fz/fm)
                {
                    fm = p[k].w;
                    fz = p[i].w;
                    flag = 1;
                }
                break;
            }
        }
    }
    if(!flag) cout<<"IMPOSSIBLE";
    else if(fz%fm==0) cout<<fz/fm;
    else{
        int x = __gcd(fm,fz);
        cout<<fz/x<<"/"<<fm/x<<endl;
    }
    return 0;
}