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 = 1e6;
const double inf = 1e100;
int sz[MAXN], v[MAXN], c, N;
double w[MAXN], cost[MAXN], grad[MAXN];
vector<pair<int, int> > g[MAXN];
pair<double, int> r(inf, 0);
int center(int i, int p, int tsz) {
  int sz = 1, msz = 0;
  for (pair<int, int> j : g[i])
    if (j.first != p && !v[j.first]) {
      int x = center(j.first, i, tsz);
      msz = max(msz, x);
      sz += x;
    }
  if (max(tsz - sz, msz) <= tsz / 2) c = i;
  return sz;
}
void dfs(int i, int p, int d) {
  grad[i] = sqrt(d) * w[i];
  cost[i] = d * grad[i];
  for (pair<int, int> j : g[i])
    if (j.first != p) {
      dfs(j.first, i, d + j.second);
      grad[i] += grad[j.first];
      cost[i] += cost[j.first];
    }
}
void solve(int i) {
  center(i, 0, center(i, 0, 0));
  dfs(c, 0, 0);
  v[c] = 1;
  double scost = 0, sgrad = 0;
  for (pair<int, int> j : g[c]) {
    scost += cost[j.first];
    if (!v[j.first]) sgrad += grad[j.first];
  }
  r = min(r, {scost, c});
  for (pair<int, int> j : g[c])
    if (!v[j.first] && sgrad - 2 * grad[j.first] < 0) {
      solve(j.first);
      return;
    }
}
int main() {
  scanf("%d", &N);
  for (int i = 1; i <= N; i++) scanf("%lf", &w[i]);
  for (int i = 1, x, y, l; i <= N - 1; i++) {
    scanf("%d%d%d", &x, &y, &l);
    g[x].push_back({y, l});
    g[y].push_back({x, l});
  }
  solve(1);
  printf("%d %20.20lf\n", r.second, r.first);
}
