3
1 1 5
1 3 42
1 2 42
 2
42 23
1 2 10
 10
45792697 27183921 4791060 77070594 27286110 66957065 19283638 2944837 26775511 65379701
5 8 25
8 10 94
1 4 14
9 7 96
4 2 16
2 6 58
2 3 99
6 8 21
8 9 87
 5
3 1 2 6 5
1 2 3
2 3 1
4 3 9
5 3 1
 10
26 31 21 57 56 44 54 58 79 97
2 1 277
1 8 91
1 7 380
4 1 649
10 5 799
10 1 940
8 6 627
6 3 177
9 6 685
 10
8 100 62 38 26 51 26 23 77 32
6 8 29
4 1 82
7 8 66
7 10 67
8 9 98
6 1 14
1 5 48
3 1 58
2 9 90
 2
23 42
1 2 10
 1
42
 3
1 5 1
1 3 42
1 2 42
 10
1 1 1 1 1 1 1 1 1 1
1 2 5
1 3 5
1 4 5
1 5 5
1 6 5
1 7 5
1 8 5
1 9 5
1 10 5
 3
1 1 1
1 2 42
2 3 42
 3
5 1 1
1 3 42
1 2 24

3 1042.0638260857 1 727.3238618387 6 283959805416.40496826
 3 192.0000000000 1 13952642.4776933547 8 544327.1927847408 2 727.3238618387 1 0.0000000000 2 1042.0638260857 1 100.6230589875 2 544.3822186663 1 389.7666169867
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 100;
const double INF = 1e25 + 100;
int n, siz[MAXN], w[MAXN], Res;
double Ans = INF, sum, sum2;
bool vis[MAXN];
vector<pair<int, int> > G[MAXN];
void Cal(int u, int f, long long dis) {
  sum += sqrt(dis) * (double)dis * (double)w[u];
  sum2 += sqrt(dis) * (double)w[u];
  for (auto tmp : G[u]) {
    int v = tmp.first;
    if (v - f) Cal(v, u, dis + tmp.second);
  }
}
void GetSz(int u, int f = -1) {
  siz[u] = 1;
  for (auto tmp : G[u]) {
    int v = tmp.first;
    if (v - f && !vis[v]) GetSz(v, u), siz[u] += siz[v];
  }
}
int mn, Cen, Kol;
void GetRt(int u, int f = -1) {
  int pmt = Kol - siz[u];
  for (auto tmp : G[u]) {
    int v = tmp.first;
    if (v - f && !vis[v]) GetRt(v, u), pmt = max(pmt, siz[v]);
  }
  if (pmt < mn) mn = pmt, Cen = u;
}
void Do(int u = 0) {
  GetSz(u);
  mn = n + 1;
  Kol = siz[u];
  GetRt(u);
  int mx2 = u;
  double mx = 0;
  sum = 0;
  for (auto tmp : G[Cen]) {
    int v = tmp.first;
    sum2 = 0;
    Cal(v, Cen, tmp.second);
    cerr << '@' << v << endl;
    if (sum2 > mx) mx = sum2, mx2 = v;
  }
  cerr << '#' << ' ' << Cen << ' ' << fixed << setprecision(5) << sum << endl;
  vis[Cen] = 1;
  if (Ans > sum) Ans = sum, Res = Cen;
  if (!vis[mx2]) Do(mx2);
}
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) cin >> w[i];
  int u, v, l;
  for (int i = 0; i < n - 1; i++) {
    cin >> u >> v >> l;
    u--;
    v--;
    G[u].push_back({v, l}), G[v].push_back({u, l});
  }
  Do();
  cout << Res + 1 << ' ' << fixed << setprecision(20) << Ans << endl;
}
