1. 1
2. 2
3. 3
4. 4
5. 5
6. 6
7. 7
8. 8
9. 9
10. 10
11. 11
12. 12
13. 13
14. 14
15. 15
16. 16
17. 17
18. 18
19. 19
20. 20
21. 21
22. 22
23. 23
24. 24
25. 25
26. 26
27. 27
28. 28
29. 29
30. 30
31. 31
32. 32
33. 33
34. 34
35. 35
36. 36
37. 37

#include <bits/stdc++.h>
#define f first
#define s second
using namespace std;
typedef pair<int, int> ii;

int S[100001];
vector<ii> G[100001];

int main() {
	ifstream cin("timeline.in");
	ofstream cout("timeline.out");

	int N, M, C;
	cin >> N >> M >> C;
	for (int i = 0; i < N; ++i) cin >> S[i];
	for (int i = 0; i < C; ++i) {
		int a, b, x;
		cin >> a >> b >> x;
		G[--a].emplace_back(--b, -x);
	}
	for (int i = 0; i < N; ++i) S[i] = -S[i];
	priority_queue<ii, vector<ii>, greater<ii>> pq;
	for (int i = 0; i < N; ++i) pq.emplace(S[i], i);
	while (!pq.empty()) {
		int d = pq.top().f, u = pq.top().s;
		pq.pop();
		if (d > S[u]) continue;
		for (auto& v : G[u]) {
			if (S[u] + v.s < S[v.f]) {
				S[v.f] = S[u] + v.s;
				pq.emplace(S[v.f], v.f);
			}
		}
	}
	for (int i = 0; i < N; ++i) cout << -S[i] << '\n';
}