1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91

#include <bits/stdc++.h>

using namespace std;
using ll = long long;
#define int ll
using PII = pair<int, int>;
template <typename T> using V = vector<T>;
template <typename T> using VV = vector<V<T>>;
template <typename T> using VVV = vector<VV<T>>;

#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define PB push_back

const ll INF = (1LL<<60);
const int MOD = 1000000007;

template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template <typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }
template <typename T> bool IN(T a, T b, T x) { return a<=x&&x<b; }
template<typename T> T ceil(T a, T b) { return a/b + !!(a%b); }
template<class S,class T>
ostream &operator <<(ostream& out,const pair<S,T>& a){
  out<<'('<<a.first<<','<<a.second<<')';
  return out;
}
template<class T>
ostream &operator <<(ostream& out,const vector<T>& a){
  out<<'[';
  REP(i, a.size()) {out<<a[i];if(i!=a.size()-1)out<<',';}
  out<<']';
  return out;
}

int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};

signed main(void)
{
  cin.tie(0);
  ios::sync_with_stdio(false);

  int n, m, x;
  cin >> n >> m >> x;
  V<int> t(n);
  REP(i, n) cin >> t[i];
  VV<PII> g(n);
  REP(i, m) {
    int a, b, d;
    cin >> a >> b >> d, a--, b--;
    g[a].PB({b, d});
    g[b].PB({a, d});
  }

  // d[i][j][k] = (頂点iを最後に通ってtypeKを通ってからj分経った)
  VVV<int> d(n, VV<int>(x+1, V<int>(2, INF)));
  d[0][0][0] = 0;
  priority_queue<V<int>, VV<int>, greater<V<int>>> que;
  que.push({d[0][0][0], 0, 0, 0});

  while(que.size()) {
    V<int> v = que.top(); que.pop();
    int cost = v[0], ver = v[1], time = v[2], type = v[3];
    if(d[ver][time][type] < cost) continue;
    // cout << v << endl;
    for(auto i: g[ver]) {
      if((type == 0 && t[i.first] == 2 && time+i.second < x)
        || (type == 1 && t[i.first] == 0 && time+i.second < x)) continue;

      int ntype;
      int ntime;
      if(t[i.first]==0 || t[i.first]==2) ntime = 0;
      else ntime = min(x, time+i.second);
      if(t[i.first]==0) ntype=0;
      else if(t[i.first]==1) ntype=type;
      else if(t[i.first]==2) ntype=1;

      if(d[i.first][ntime][ntype] > d[ver][time][type] + i.second) {
        d[i.first][ntime][ntype] = d[ver][time][type] + i.second;
        que.push({d[i.first][ntime][ntype], i.first, ntime, ntype});
      }
    }
  }

  int ans = INF;
  REP(i, x+1) REP(j, 2) chmin(ans, d[n-1][i][j]);
  cout << ans << endl;

  return 0;
}