cf938d(建图技巧+最短路新模板)

这个题还是蛮好的。。充分反应了窝智商不够题又做得不多的事实。。。

这个需要建图（网络流既视感。。），先把原图的边权值*2，建一个超级源点，连到各个点 ，权值为ai，然后跑最短路即可，每条从源点出发的路径可以看做一种反过来的方案。。。

汪聚聚说看到多源最短路就要想到建图。。orz果然窝是经验不足。。之前以为建图是网络流特色。。其实图论应该都有这类操作，以后得好好学学。。。

另外。。在cf用spfa一下子就被hack掉了。。所以还是改用dij比较好。。有了stl写起来非常舒服，和spfa也差不了多少。。有个入队时的d和当前d的比较好像可以优化一下，不过写起来太丑了就不写了，貌似也优化不了多少。。

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<queue>
#include<cmath>
#include<map>
#include<stack>
#define inc(i,l,r) for(int i=l;i<=r;i++)
#define dec(i,l,r) for(int i=l;i>=r;i--)
#define link(x) for(edge *j=h[x];j;j=j->next)
#define mem(a) memset(a,0,sizeof(a))
#define ll long long
#define eps 1e-8
#define succ(x) (1<<x)
#define lowbit(x) (x&(-x))
#define sqr(x) ((x)*(x))
#define mid (x+y>>1)
#define NM 400005
#define nm 1000498
#define pi 3.1415926535897931
using namespace std;
const ll inf=1e18;
ll read(){
    ll x=0,f=1;char ch=getchar();
    while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
    while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
    return f*x;
}




struct node{
	int x;ll d;
	bool operator<(const node&o)const{return d>o.d;}
};
struct edge{int t;ll v;edge*next;}e[nm],*h[NM],*o=e;
void add(int x,int y,ll v){o->t=y;o->v=v;o->next=h[x];h[x]=o++;}
int n,m,_x,_y;
ll _t,d[NM];
bool v[NM];
priority_queue<node>q;

void dij(){
	inc(i,1,n)d[i]=inf;q.push((node){0,0});
	while(!q.empty()){
		int t=q.top().x;q.pop();
		link(t)if(d[j->t]>d[t]+j->v)d[j->t]=d[t]+j->v,q.push((node){j->t,d[j->t]});
	}
}

int main(){
	n=read();m=read();
	inc(i,1,m){_x=read();_y=read();_t=read()*2;add(_x,_y,_t);add(_y,_x,_t);}
	inc(i,1,n)add(0,i,read());
	dij();
	inc(i,1,n)printf("%I64d ",d[i]);putchar('\n');
	return 0;
}

D. Buy a Ticket

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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 v_i to city u_i (and from u_i to v_i), and it costs w_i coins to use this route.

Each city will be visited by "Flayer", and the cost of the concert ticket in i-th city is a_i 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·10⁵, 1 ≤ m ≤ 2·10⁵).

Then m lines follow, i-th contains three integers v_i, u_i and w_i (1 ≤ v_i, u_i ≤ n, v_i ≠ u_i, 1 ≤ w_i ≤ 10¹²) 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 a₁, a₂, ... a_k (1 ≤ a_i ≤ 10¹²) — 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

6 14 1 25 

Input

Copy

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

Output

12 10 12