We have a graph with N vertices and M edges, and there are two people on the graph: Takahashi and Aoki.
The i-th edge connects Vertex U_i and Vertex V_i.
The time it takes to traverse this edge is D_i minutes, regardless of direction and who traverses the edge (Takahashi or Aoki).
Takahashi departs Vertex S and Aoki departs Vertex T at the same time. Takahashi travels to Vertex T and Aoki travels to Vertex S, both in the shortest time possible.
Find the number of the pairs of ways for Takahashi and Aoki to choose their shortest paths such that they never meet (at a vertex or on an edge) during the travel, modulo 10^9 + 7.

-----Constraints-----
 - 1 \leq N \leq 100 000
 - 1 \leq M \leq 200 000
 - 1 \leq S, T \leq N
 - S \neq T
 - 1 \leq U_i, V_i \leq N (1 \leq i \leq M)
 - 1 \leq D_i \leq 10^9 (1 \leq i \leq M)
 - If i \neq j, then (U_i, V_i) \neq (U_j, V_j) and (U_i, V_i) \neq (V_j, U_j).
 - U_i \neq V_i (1 \leq i \leq M)
 - D_i are integers.
 - The given graph is connected.

-----Input-----
Input is given from Standard Input in the following format:
N M
S T
U_1 V_1 D_1
U_2 V_2 D_2
:
U_M V_M D_M

-----Output-----
Print the answer.

-----Sample Input-----
4 4
1 3
1 2 1
2 3 1
3 4 1
4 1 1

-----Sample Output-----
2

There are two ways to choose shortest paths that satisfies the condition:
 - Takahashi chooses the path 1 \rightarrow 2 \rightarrow 3, and Aoki chooses the path 3 \rightarrow 4 \rightarrow 1.
 - Takahashi chooses the path 1 \rightarrow 4 \rightarrow 3, and Aoki chooses the path 3 \rightarrow 2 \rightarrow 1.

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

ns = {"__name__": "__main__"}
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = '# ARC090E\n\ndef hoge():\n    M = 10**9 + 7\n    import sys\n    input = lambda : sys.stdin.readline().rstrip()\n\n    n, m = map(int, input().split())\n    s, t = map(int, input().split())\n    s -= 1\n    t -= 1\n    from collections import defaultdict\n    ns = defaultdict(set)\n    for i in range(m):\n        u, v, d = map(int, input().split())\n        ns[u-1].add((v-1, d))\n        ns[v-1].add((u-1, d))\n    \n    def _dijkstra(N, s, Edge):\n        import heapq\n        geta = 10**15\n        inf = geta\n        dist = [inf] * N\n        dist[s] = 0\n        Q = [(0, s)]\n        dp = [0]*N\n        dp[s] = 1\n        while Q:\n            dn, vn = heapq.heappop(Q)\n            if dn > dist[vn]:\n                continue\n            for vf, df in Edge[vn]:\n                if dist[vn] + df < dist[vf]:\n                    dist[vf] = dist[vn] + df\n                    dp[vf] = dp[vn]\n                    heapq.heappush(Q, (dn + df,vf))\n                elif dist[vn] + df == dist[vf]:\n                    dp[vf] = (dp[vf] + dp[vn]) % M\n        return dist, dp\n\n    def dijkstra(start):\n        import heapq\n        vals = [None] * n\n        nums = [None] * n\n        nums[start] = 1\n        h = [(0, start)] # (距離, ノード番号)\n        vals[start] = 0\n        while h:\n            val, u = heapq.heappop(h)\n            for v, d in ns[u]:\n                if vals[v] is None or vals[v]>val+d:\n                    vals[v] = val+d\n                    nums[v] = nums[u]\n                    heapq.heappush(h, (vals[v], v))\n                elif vals[v] is not None and vals[v]==val+d:\n                    nums[v] = (nums[v] + nums[u]) % M\n        return vals, nums\n    \n    vals1, nums1 = dijkstra(s)\n    vals2, nums2 = dijkstra(t)\n    \n    T = vals1[t]\n\n    c1 = 0 # 頂点で衝突するペアの数\n    c2 = 0 # エッジ(端点除く)で衝突するペアの数\n    \n    for u in range(n):\n        if 2*vals1[u]==T and 2*vals2[u]==T:\n            c1 = (c1 + pow((nums1[u] * nums2[u]), 2, M)) % M\n        for v,d in ns[u]:\n            if (vals1[u]+d+vals2[v]==T) and (2*vals1[u] < T < 2*(vals1[u] + d)):\n                c2 = (c2 + (nums1[u] * nums2[v])**2) % M\n    print((nums1[t]*nums2[s] - (c1+c2)) % M)\nhoge()'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

```

Measured memory_bytes: 15005