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 long long linf = 1e18 + 5;
int mod = (int)1e9 + 7;
const int logN = 18;
const int inf = 1e9 + 9;
const int N = 3e5 + 5;
int n, m, x, y, z, t, c[N], p, sum[N], h[N];
double G[N];
vector<pair<int, int> > v[N];
vector<pair<double, int> > ans;
int prep(int node, int root) {
  sum[node] = 1;
  for (__typeof(v[node].begin()) it = v[node].begin(); it != v[node].end();
       it++)
    if (!h[it->first] && it->first != root) sum[node] += prep(it->first, node);
  return sum[node];
}
int find(int node, int root, int S) {
  for (__typeof(v[node].begin()) it = v[node].begin(); it != v[node].end();
       it++)
    if (it->first != root && !h[it->first] && sum[it->first] > S)
      return find(it->first, node, S);
  return node;
}
double dfs(int node, int root, int dist) {
  double ans = dist * sqrt(dist) * c[node];
  for (__typeof(v[node].begin()) it = v[node].begin(); it != v[node].end();
       it++)
    if (it->first != root) ans += dfs(it->first, node, dist + it->second);
  return ans;
}
void find(int node) {
  prep(node, 0);
  node = find(node, 0, sum[node] / 2);
  h[node] = 1;
  int S = 0;
  ans.push_back(make_pair(dfs(node, 0, 0), node));
  double d2 = 0, temp;
  for (__typeof(v[node].begin()) it = v[node].begin(); it != v[node].end();
       it++) {
    if (!h[it->first]) {
      d2 += temp = dfs(it->first, node, it->second);
      G[++S] = dfs(it->first, node, 0) - temp;
    }
  }
  S = 0;
  pair<double, int> go = make_pair(linf, 0);
  for (__typeof(v[node].begin()) it = v[node].begin(); it != v[node].end();
       it++) {
    if (!h[it->first]) {
      go = min(go, make_pair(d2 + G[++S], it->first));
    }
  }
  if (S) find(go.second);
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &c[i]);
  }
  for (int i = 2; i <= n; i++) {
    scanf("%d %d %d", &x, &y, &z);
    v[x].push_back(make_pair(y, z));
    v[y].push_back(make_pair(x, z));
  }
  find(1);
  sort(ans.begin(), ans.end());
  printf("%d %.12lf\n", ans.begin()->second, ans.begin()->first);
  return 0;
}
