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
38. 38
39. 39
40. 40
41. 41

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

int dist[5005];
vector<ii> G[5005];

int main() {
	ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	int N, M, C; cin >> N >> M >> C;
	for (int u = 1; u <= N; ++u) {
		int s, t; cin >> s >> t;
		G[u].emplace_back(-s, 0);
		G[0].emplace_back(t, u);
	}
	while (C--) {
		int a, b, x; cin >> a >> b >> x;
		G[a].emplace_back(-x, b);
	}
	memset(dist, '?', sizeof dist);
	dist[0] = 0;
	for (int i = 0; i < N; ++i) {
		for (int u = 0; u <= N; ++u) {
			for (auto& v : G[u]) {
				if (dist[u] + v.f < dist[v.s]) dist[v.s] = dist[u] + v.f;
			}
		}
	}
	for (int u = 0; u <= N; ++u) {
		for (auto& v : G[u]) {
			if (dist[u] < 0 || dist[u] > M || dist[u] + v.f < dist[v.s]) {
				cout << "impossible\n";
				return 0;
			}
		}
	}
	for (int u = 1; u <= N; ++u) cout << dist[u] << '\n';
	return 0;
}