D. Buy a Ticket

D. Buy a Ticket

Musicians of a popular band "Flayer" have announced that they are going to "make their exit" with a world tour. Of course, they will visit Berland as well.

There are n cities in Berland. People can travel between cities using two-directional train routes; there are exactly m routes, i-th route can be used to go from city vi to city ui (and from ui to vi), and it costs wi coins to use this route.

Each city will be visited by "Flayer", and the cost of the concert ticket in i-th city is ai coins.

You have friends in every city of Berland, and they, knowing about your programming skills, asked you to calculate the minimum possible number of coins they have to pay to visit the concert. For every city i you have to compute the minimum number of coins a person from city i has to spend to travel to some city j (or possibly stay in city i), attend a concert there, and return to city i (if j ≠ i).

Formally, for every  you have to calculate , where d(i, j) is the minimum number of coins you have to spend to travel from city i to city j. If there is no way to reach city j from city i, then we consider d(i, j) to be infinitely large.

Input

The first line contains two integers n and m (2 ≤ n ≤ 2·105, 1 ≤ m ≤ 2·105).

Then m lines follow, i-th contains three integers vi, ui and wi (1 ≤ vi, ui ≤ n, vi ≠ ui, 1 ≤ wi ≤ 1012) denoting i-th train route. There are no multiple train routes connecting the same pair of cities, that is, for each (v, u) neither extra (v, u) nor (u, v) present in input.

The next line contains n integers a1, a2, ... ak (1 ≤ ai ≤ 1012) — price to attend the concert in i-th city.

Output

Print n integers. i-th of them must be equal to the minimum number of coins a person from city i has to spend to travel to some city j (or possibly stay in city i), attend a concert there, and return to city i (if j ≠ i).

Examples

input

Copy

4 2
1 2 4
2 3 7
6 20 1 25

output

Copy

6 14 1 25

input

Copy

3 3
1 2 1
2 3 1
1 3 1
30 10 20

output

Copy

12 10 12

 For each point i, find the shortest distance to j that is the smallest of 2d(i,j)+aj, and use ai if the day is smaller.

You can add a super source point, the distance from the source point to each point is ai, and then double the distance of each edge. The idea is very clever.

 1 #include <bits/stdc++.h>
 2 #define ll long long
 3 using namespace std;
 4 const int N = 2e5+10;
 5 typedef pair<ll,int> P;
 6 vector<P> vs[N];
 7 int n, m, u, v;
 8 ll w, x, d[N];
 9 void dij(int s) {
10     for(int i = 1; i <= n; i ++) {
11         d[i] = 1LL<<60;
12     }
13     d[s] = 0;
14     priority_queue<P, vector<P>, greater<P> >que;
15     que.push(P(0,s));
16     while(que.size()) {
17         P p = que.top();
18         que.pop();
19         int u = p.second;
20         if(d[u] < p.first) continue;
21         for(int i = 0; i < vs[u].size(); i ++) {
22             P x = vs[u][i];
23             if(d[x.second] > d[u] + x.first) {
24                 d[x.second] = d[u] + x.first;
25                 que.push(P(d[x.second],x.second));
26             }
27         }
28     }
29 }
30 int main() {
31     ios_base::sync_with_stdio(false);
32     cin.tie(0);
33     cout.tie(0);
34     cin >> n >> m;
35     for(int i = 1; i <= m; i ++) {
36         cin >> u >> v >> w;
37         vs[u].push_back(P(2*w,v));
38         vs[v].push_back(P(2*w,u));
39     }
40     for(int i = 1; i <= n; i ++) {
41         cin >> x;
42         vs[n+1].push_back(P(x,i));
43     }
44     dij(n+1);
45     for(int i = 1; i <= n; i ++) {
46         printf("%lld%c",d[i]," \n"[i==n]);
47     }
48     return 0;
49 }