SCU OJ_4444_ Travel_最短路（大数据）

I - Travel
Time Limit:0MS     Memory Limit:0KB     64bit IO Format:%lld & %llu
Submit Status

Description
Travel

The country frog lives in has n
towns which are conveniently numbered by 1,2,…,n

.

Among n(n?1)2
pairs of towns, m of them are connected by bidirectional(双向的) highway(公路), which needs a minutes to travel.
The other pairs are connected by railway, which needs b

minutes to travel.

Find the minimum(最小的) time to travel from town 1
to town n

.
Input

The input(投入) consists of multiple tests. For each test:

The first line contains 4
integers n,m,a,b (2≤n≤105,0≤m≤5?105,1≤a,b≤109). Each of the following m lines contains 2 integers ui,vi,
 which denotes(表示) cities ui and vi are connected by highway(公路). (1≤ui,vi≤n,ui≠vi

).
Output